DETERMINISTIC METHODS

CONTRIBUTION COLLABORATIVE WORK No. 2

PRESENTED BY
ANGELICA MARIA LOSADA
CODE 26471886
MARIA CLEMENCIA TORRES
CODE: 51.817.490

YURANY DIAZ

WESTMINTER MANYOMA
Tutor

SCHOOL OF ADMINISTRATIVE, ACCOUNTING, ECONOMIC SCIENCES

AND BUSINESS
NATIONAL OPEN AND DISTANCE UNIVERSITY 'UNAD'
November 2011
 INTRODUCTION

The goal of a transport model is to minimize the total cost of a shipment.

a product from points of existence to points of demand, for
that this is carried out in the best way and reach an optimal answer,
feasible and effective that meets the expectations of factories or warehouses
where I minimized shipping costs and generated good profits is done through
the design of algorithm solution procedures: distribution networks
where the transportation model, the allocation method, and the
CPM-PERT models allow us to find optimal solutions to problems in
the different problems that may arise in our environment
labor and professional.

With this work corresponding to unit two, we see the topics about
Distribution Networks and Project Management, which are
addressed to the deepening of methods used to solve
problems related to transportation, assignment, as well as learning
about project management and evaluation; knowing various
tools for solving simple and complex problems that are
they present in our daily life both personally and professionally.

Regarding the workshops from chapters one, two, and three, we learned to
distinguish the handling of the various tools and practices known in the
module to strengthen our knowledge in the workplace
and personal.

.
 GENERAL OBJECTIVE

Apply the relevant themes to chapters 1, 2, and 3 (model of

transport, assignment models, CPM-PERT model). in the development of
workshops.

SPECIFIC OBJECTIVES

Read chapters 1, 2, and 3 (transport model,

allocation models, CPM-PERT model.

Interact with the collaborative group through social networks and other means

Identify the different algorithms used to solve the problems.

Propose and present application problems where Models are used.

Prototype to solve PD problems.
 DEVELOPMENT OF THE ACTIVITY

1.11 WORKSHOP

[Link] Gasoline Dispensers A, B, C, and D require 50,000, 40,000, 60,000

and 40,000 gallons of gasoline respectively. It is possible to meet these
demands from locations 1, 2 and 3 that have 80,000, 100,000 and
50,000 gallons respectively. The costs of dispatching 1,000 gallons of
The gasoline presented in Table No. 2 indicates that it costs $70. Send 1,000.
gallons of gasoline from location 1 to vendor A, $80 send 1,000
gallons of gasoline from location 2 to dispenser B, etc.

The problem consists of determining the amounts of gasoline that should be sent.
from each locality to each vendor, so that the requirements of
the distributors are satisfied and that the total shipping costs are
minimums.

Table No. 2 (Gasoline Dispensers)

Solution

NORTHWEST CORNER METHOD:

Localities A B C D Fictitious Offer

1 50,000 70 60 80 30,000 60 80,000

2 50 80
60,000 60 70
40,000 100,000

3 80
40,000 50 80
10,000 60
50,000

Demand 50,000 40,000 60,000 40,000 40,000 230,000

Cost: 50,000x (70) + 40,000x (50) + 60,000x (60) + 30,000x (60) +

10,000 x (60)
Cost: 3,500,000 + 2,000,000 + 3,600,000 + 1,800,000 + 600,000 = $
11,500,000
 MINIMUM COSTS METHOD:

Localities A B C D Fictitious Offer

1 // 70 // 60 // 80 40,000 60 40,000 80,000

2 50,000 50 // 80 50,000 60 // 70 // 100,000

3 // 80
40,000 50
10,000 80
// 60 // 50,000

Demand 50,000 40,000 60,000 40,000 40,000 230,000

Cost: 50,000x (50) + 40,000x (50) + 50,000x (60) + 10,000x (80) + 40,000x
(60))
Cost= 2,500,000 + 2,000,000 + 3,000,000 + 800,000 + 2,400,000 = $
10,700,000
VOGEL'S APPROXIMATION METHOD:

Localities A B C D Fictitious Offer

1 10,000 70 // 60 // 80 30,000 60 40,000 80,000

2 40,000 50 // 80 60,000 60 // 70 // 100,000

3 // 80 40,000 50 // 80 10,000 60 // 50,000

Demand 50,000 40,000 60.000 40,000 40,000 230,000

20 10 20 0
20 10 - 0
10 10 - 0

Cost: 10,000x (70) + 30,000x (60) + 40,000x (50) + 60,000x (60) + 40,000x
(50)+10.000x (60)
Cost: 700,000 + 1,800,000 + 2,000,000 + 3,600,000 + 2,000,000 + 600,000 = $
10,700,000
 STONE JUMP METHOD:

Localities A B C D Offer

1 70 60 50,000 80
30,000 80,000
60

2 50,000
50
+
80
10,000-
60
+
70 60,000

3 + 80 40,000 50 + 80
10,000- 60 50,000

Demand 50,000 40,000 60,000 40,000 190,000

RTA: for the most optimal solution, the Vogel's approximation method is used.
and the Minimum Cost method.

2. Three deposits supply five warehouses. The table indicates the cost of
transport per unit between deposits and warehouses, the capacities of the
deposits and warehouse requirements. However, the damage of a
main bridge has prevented deliveries from depot A to the
warehouse 5, from depot B to warehouse 2 and from depot C to
the warehouse 4. Determine the optimal scheme within these limitations
deliveries.
 TODO NORTHWEST CORNER:
#
Warehouse A B C Required

1 75 $2 0 $4 0 $6 75

2 345
$3
x
$8
0 $7
345

3 180
$4 $3
0
$8
180

4 90 $4 $6 x $3 90

5 x
$2
210
$6 $5
210

Fictitious 160 90 450 700

Capacity 850 300 450 1600

(75 x 2) + (345 x 3) + (180 x 4) + (90 x 4) + (210 x 6)

Cost = 150 + 1.035 + 720 + 360 + 1.260 = 3.525

MINIMUM COST METHOD:

#
Warehouse A B C Required

1 75 $2 0 $4 0 $6 75

2 345 $3
x
$8
0 $7 345

3 0
$4
180
$3
0
$8 180

4 90 $4 $6 x $3 90

5 x 210 210
$2 $6 $5

Fictitious 340 120 450 700

Capacity 850 300 450 1600

(75 x 2) + (345 x 3) + (90 x 4) + (180 x 3) + (210 x 5)

Costo =150 + 1.035 + 360 + 540 + 1.050 =3.135
 VOGEL APPROXIMATION METHOD:
#
Warehouse A B C Required

1 75 $2 0 $4 0 $6 75

2 345 $3
x
$8
0 $7 345

3 180
$4 $3
0
$8 180

4 90 $4 $6 x $3 90

5 x 210 210
$2 $6 $5

Fictional 160 90 450 700

Capacity 850 300 450 1600

1 1 1
2 1 1
2 1 1
- 1 1

(75 x 2) + (345 x 3) + (180 x 4) + (90 x 4) + (210 x 6)

Cost = 150 + 1.035 + 720 + 360 + 1.260 = 3.525
A company has three main distributors that supply five
retailers. The following table shows the distances
between distributors and merchants, the requirements of the merchants
and the capabilities of the distributors. Determine which distributors
they must supply the merchants to minimize the total distance required.

Table No. 17-1 (Distributor)

LOCALITIES A B C No. required
1 6 7 8 12
2 4 6 7 15
3 5 7 6 21
4 4 4 9 24
5 8 3 5 24
Available number 15 48 33
 Changing rows to columns and vice versa:

Table No. 17-2 (Distributor)

Distribution / 1 2 3 4 5 OFFER
Traders
A 6 4 5 4 8 15
B 7 6 7 4 3 48
C 8 7 6 9 5 33
DEMAND 12 15 21 24 24 96

Distribution / 1 2 3 4 5 OFFER Difference

Merchants Row
A - 6 15 4 - 5 - 4 - 8 15 0
B 7 - 6 7 4 3 48 1
C 8 - 7 6 9 5 33 1
DEMAND 12 15 21 24 24 96
Difference 1 2 1 0 2
Column

Now we again take the differences of rows and columns, and

we observe that in column 4 we get the greatest difference that
is 5, placing the maximum quantity in the row of lowest cost that the
the column and the row allow it. It is 24 and with this, this is completed.
column.

Distribution / 1 2 3 4 5 OFFER
Merchants Fila
A - 6 15 4 - 5 - 4 - 8 15 -
B 7 - 6 7 4 3 48 4
C 8 - 7 6 9 5 33 1
DEMAND 12 15 21 24 24 96
Difference 1 - 1 5 2
Column
 Now the new largest difference is 4 in row B, with the lowest cost 3,
In this cell we place 24 to close the row, leaving row C with
complete
Distribution / 1 2 3 4 5 OFFER
Merchants Fila
A - 6 15 4 - -5 4 - 8 15 -
B 7 - 6 7 24 4 24 3 48 4
C 8 - 7 6 9 5 33 1
DEMAND 12 15 21 24 24 96
Difference 1 - 1 - 2
Column
I completed row C by placing the values of 12 and 21, which close to the
see columns 1 and 3

Distribution / 1 2 3 4 5 OFFER Difference

Merchants Line
A 6 15 4- 5 - 4 - 8 15 -
B 7 - 76 24 4 24 3 48 -
C 12 8 - 7 21 6 9 5 33 -
DEMAND 12 15 21 24 24 96

So we can now obtain the minimum distance value which is:

15(4) + 12(8) + 21(6) + 24(4) + 24(3) = 450

() () () () ()

Distributor A supplies the merchant 2, distributor B supplies half of his

units available to warehouse 4 and to warehouse 5 the other half. Distributor C
leave warehouse 1 and warehouse 3.

Answer: The best method is the minimum cost.

 WORKSHOP CHAPTER 2

1 The construction company Briñez CIA has four contractors 1, 2, 3, 4; the

They propose to build four offices for a telecommunications company.
mobile, each contractor has proposed for the construction of the offices the
next quotation. Determine which office each contractor will use to achieve
a minimum cost in the construction of eachoffice.

SOLUTION
Step 1. Subtract the smallest value in each row

1 2 3 4
A 4 4 6 0
B 0 4 4 12
C 11 9 5 0
D 0 2 12 4

The smallest value in each column is subtracted, it is added in zero intercepts, it

they cross the columns by zeros (0's)

1 2 3 4
A 4 2 2 0
B 0 2 0 13
C 11 7 1 0
D 0 0 8 5
Choose a zero for each column
1 2 3 4
A 3 1 1 0
B 0 0 0 13
C 10 6 0 0
D 0 0 8 5
It references the position in the initial table

Offices Contractors
1 2 3 4
A 48 48 50 44
B 56 60 60 68
C 96 94 90 85
D 42 44 54 46
Determine the Assignment of Minimization:

B 56 + 44 + 90 + 44 = 234

2. At El Dorado airport, there are four airlines with different hours of

flight to five different destinations around the world. Each is requested to
airline the shortest arrival time for each of the destinations

SOLUTION

PARIS KOREA LONDON EGYPT Moscow

AVIANCA 17 21 14 15 20
AIRLINES 18 23 9 17 26
INTER 16 20 12 16 23
IBERIA 17 19 11 14 24
Items 99 99 99 99 99

The smallest value in each row is subtracted.

PARIS KOREA LONDON EGYPT Moscow

AVIANCA 3 7 0 1 6
AIRLINES 9 14 0 8 17
INTER 4 8 0 4 11
IBERIA 6 8 0 3 13
Items 0 0 0 0 0

The columns intersect at zeros (0's)

 PARIS KOREA LONDON EGYPT Moscow
AVIANCA 3 7 0 1 6
AIRLINES 9 14 0 8 17
INTER 4 8 0 4 11
IBERIA 6 8 0 3 13
Items 0 0 0 0 0

Where the zeros do not intersect, the smaller value in the cells is subtracted, and then added.
the same value in the intercepts, a zero is chosen for each column

PARIS KOREA LONDON EGYPT Moscow

AVIANCA 2 6 0 1 5
AIRLINES 8 13 0 7 16
INTER 3 7 0 3 10
IBERIA 5 7 0 2 12
Items 0 0 1 0 0

Where the zeros do not cross, the smaller value in the cells is subtracted, and the result is added.
same value in the intercepts, one zero is chosen for each column

PARIS KOREA LONDON EGYPT Moscow

AVIANCA 0 4 0 0 3
AIRLINES 6 11 0 7 14
INTER 1 5 0 3 8
IBERIA 3 5 0 2 10
Items 0 0 3 0 0

Where the zeros do not intersect, the smaller value in the cells is subtracted, and the result is added.
the same value in the intercept and one zero is chosen for each column
 PARIS KOREA LONDON EGYPT Moscow
AVIANCA 0 4 3 0 3
AIRLINES 5 10 0 7 13
INTER 0 4 0 3 7
IBERIA 2 4 0 2 9
Items 0 0 4 0 0
Where the zeros do not cross, the smallest value in the cells is subtracted, and it is added.
the same value in the intercepts and a zero is chosen for each column

PARIS KOREA LONDON EGYPT MOSCOW

AVIANCA 0 4 7 0 3
AIRLINES 5 6 0 7 9
INTER 0 0 0 3 3
IBERIA 2 0 0 2 5
Items 0 0 11 0 0
The position in the initial table is referenced.

PARIS KOREA LONDON EGYPT Moscow

AVIANCA 17 21 14 15 20
AIRLINES 18 23 9 17 26
INTER 16 20 12 16 23
IBERIA 17 19 11 14 24
Items 0 0 0 0 0

The minimization assignment is determined

16 + 19 + 9 + 15 + 0 = 59

3. In a hospital, the personnel manager has the task of filling 4 vacancies for
general medicine, 5 doctors have been presented according to the table.
presented below where the scores have been recorded of the
interview and resume. Who will be selected to occupy the
cargoes.
 SOLUTION
1 2 3 4 5
Doctor 1 8 3 1 2 9
Doctor 2 9 6 7 6 9
Doctor 3 7 3 9 8 9
Doctor 4 2 4 6 5 9
Doctor 5 7 6 3 4 9
1 2 3 4 5
It subtracts the largest value in the entire table

Doctor 1 1 6 8 7 9
Doctor 2 0 3 2 3 9
Doctor 3 2 6 0 1 9
Doctor 4 7 5 3 4 9
Doctor 5 2 3 6 5 9

The minimum value of each row is taken and subtracted from the row.

1 2 3 4 5
Doctor 1 0 5 7 6 8
Doctor 2 0 3 2 3 9
Doctor 3 2 6 0 1 9
Doctor 4 4 2 0 1 6
Doctor 5 0 1 4 3 7

The minimum value of each column is taken and subtracted from the column.

1 2 3 4 5
Doctor 1 0 4 7 5 2
Doctor 2 0 2 2 2 3
Doctor 3 2 5 0 0 3
Doctor 4 4 1 0 0 0
Doctor 5 0 0 4 2 1

The zeros are joined from greatest to least.

1 2 3 4 5
Doctor 1 0 4 7 5 2
Doctor 2 0 2 2 2 3
Doctor 3 2 5 0 0 3
Doctor 4 4 1 0 0 0
Doctor 5 0 0 4 2 1

Where the zeros do not intersect, the smaller value in the cells is subtracted and added.
the same value in the intercepts, one zero is chosen for each column
 1 2 3 4 5
Doctor 1 0 2 5 3 0
Doctor 2 0 0 0 0 1
Doctor 3 2 5 0 0 3
Doctor 4 4 1 0 0 0
Doctor 5 0 0 4 2 1

Choose a zero for each column

1 2 3 4 5
Doctor 1 0 2 5 3 0
Doctor 2 0 0 0 0 1
Doctor 3 2 5 0 0 3
Doctor 4 4 1 0 0 0
Doctor 5 0 0 4 2 1

The position in the initial table is referenced.

1 2 3 4 5
Doctor 1 8 3 1 2 0
Doctor 2 9 6 7 6 0
Doctor 3 7 3 9 8 0
Doctor 4 2 4 6 5 0
Doctor 5 7 6 3 4 0

The maximization assignment is determined:

VACANT 1–DOCTOR 2
VACANT 2 - DOCTOR 5

VACANCY 3–DOCTOR 4
VACANT 4–DOCTOR 3
NO VACANCY–DOCTOR 1

4. An administrator faces the problem of assigning four new methods to

three means of production. The allocation of new methods increases the
earnings according to the amounts shown in the following table.
Determine the optimal assignment if only one method can be assigned to one medium.
of production.

SOLUTION

Methods Means of Production

LOCALITY 1 2 3 Fictional
A 12 9 13.5 0
B 10 11 12.5 0
C 11.5 10 10 0
D 13 12 10.5 0

Methods Means of Production

LOCALITY 1 2 3 Fictitious
A 1.5 4.5 0 13.5
B 3.5 2.5 1 13.5
C 2 3.5 3.5 13.5
D 0.5 5 3 13.5

Methods Means of Production

LOCALITY 1 2 3 Fictitious
A 1.5 4.5 0 13.5
B 2.5 1.5 1 12.5
C 0 1.5 1.5 11.5
D 0 1 2.5 13
 Methods Means of Production
LOCATION 1 2 3 Fictitious
A 1.5 3.5 0 2
B 2.5 0.5 0 1
C 0 0.5 1.5
D 0 0 2.5 1.5

Methods Means of Production

LOCATION 1 2 3 Fictitious
A 1.5 3.5 0 2
B 2.5 0.5 0 1
C 0 0.5 1.5 0
D 0 0 2.5 1.5

Methods Means of Production

LOCALITY 1 2 3 Fictitious
A 1 3 0 1.5
B 2 0 0 0.5
C 0 0.5 2 0
D 0 0 3 1.5

Methods Means of Production

LOCALITY 1 2 3 Fictitious
A 1 3 0 1.5
B 2 0 0 0.5
C 0 0.5 2 0
D 0 0 3 1.5

Methods Means of Production

LOCALITY 1 2 3 Fictitious
A 12 9 13.5 0
B 10 11 12.5 0
C 11.5 10 10 0
D 13 12 10.5 0

METHOD 1 will be assigned to production medium 3 with an increase in

the profits of 13
METHOD 2 will be assigned to production medium 2 with an increase in
the earnings of 11
METHOD 3 will be assigned to production medium 1 with an increase in
the profits of 13.5
5. A construction company has five mechanical shovels in different
localities and requires a shovel at three different construction sites.
Determine the optimal transportation program for transportation costs

indicated in the table.

SOLUTION

LOCALITY A B C Fictitious Fictitious

1 2 3 4 0 0
2 7 6 4 0 0
3 3 5 8 0 0
4 4 6 5 0 0
5 4 6 3 0 0

LOCALITY A B C Fictitious Fictional

1 0 0 1 0 0
2 5 3 1 0 0
3 1 2 5 0 0
4 2 3 2 0 0
5 2 3 0 0 0

LOCALITY A B C Fictitious Fictitious

1 0 0 1 0 0
2 5 3 1 0 0
3 1 2 5 0 0
4 2 3 2 0 0
5 2 3 0 0 0

LOCATION A B C Fictitious Fictitious

1 0 0 1 1 1
2 4 2 0 0 0
3 0 1 4 1 1
4 1 2 1 0 0
5 2 3 0 0 0
 LOCALITY A B C Fictitious Fictional
1 0 0 1 0 0
2 4 2 0 0 0
3 0 1 4 0 0
4 1 2 1 0 0
5 2 3 0 0 0

LOCALITY A B C Fictional Fictitious

1 2 3 4 0 0
2 7 6 4 0 0
3 3 5 8 0 0
4 4 6 5 0 0
5 4 6 3 0 0

The shovel 1 will be assigned to construction site B at a cost of $

3D transport
The SHOVEL 2 will be assigned to construction site C at a cost of $
4th transport
The shovel will be assigned to construction site A at a cost of $
3rd transport.

6. On the grounds of a university, four different contractors 1, 2, 3, and 4 are

they propose to build four different buildings A, B, C, and D. Due to the fact that the
contractors contribute generously to the student fund, each one
it will build one of the four buildings. Each of the contractors has submitted
proposals for the construction of the four buildings. In Table 1 there
they show the proposals.
The problem consists of determining which building should be assigned to each
contractor, to achieve a minimum construction cost for the four buildings.

Solution
Building Contractors
1 2 3 4
A 14 8 26 0
B 0 29 24 42
C 0 17 4 19
D 0 20 10 12

Building Contractors
1 2 3 4
A 14 0 22 0
B 0 21 20 42
C 0 9 0 19
D 0 12 6 12

Building Contractors
1 2 3 4
A 14 0 22 0
B 0 21 20 42
C 0 9 0 19
D 0 12 6 12

Building Contractors
1 2 3 4
A 20 0 22 0
B 0 15 14 36
C 6 9 0 19
D 0 6 0 6

Building Contractors
1 2 3 4
A 26 0 28 0
B 0 9 14 30
C 0 3 0 13
D 0 0 0 0

Building Contractors
1 2 3 4
A 26 0 28 0
B 0 9 14 30
C 0 3 0 13
D 0 0 0 0
 Table No. 6 (Contractor)
BUILDING 1 2 3 4
A 48 42 60 34
B 36 65 50 78
C 76 93 80 95
D 54 74 64 66

Contractor 1 will build building B.

Contractor 2 will build building D
Contractor 3 will build building C
Contractor 4 will build Building A
 WORKSHOP No. 3

(Chapter 3)

EXERCISE 1.

Find the slack of this CPM - PERT network:

ACTIVITY PRECEDENCE TIME LOOSENESS

DEAR (YOU)
A --- 2 0
B --- 3 0
C --- 5 0
D AEB 8 0
E A 4 0
F D 1 0
G F 6 0
H G.F 7

To find the critical path, the longest moments are summed.

1. 2 + 8 + 1 + 7 = 18
2. 3 + 8 + 1 + 7 = 19
3. 3 + 8 + 1 + 6 + 7 = 25 this is the critique of the graph

Find the slack (tti–trt):

2–2 = 0
6–6 = 0
5–5 = 0
11–11 = 0
12–12 = 0
18–18 = 0
25–25 = 0
3. Compare column a with column b, and correctly identify the
definition of each concept connecting them with an arrow:

ACTIVITY REPRESENTS THE BEGINNING AND THE END OF

EACH ACTIVITY.

You ACTION OR WORK BEING CARRIED OUT

IN A TIME FRAME.

NODE PESSIMISTIC TIME.

To IT IS THE PATH THAT GOES FROM THE

FROM START TO FINISH OF THE NETWORK.

SLOP MOST LIKELY TIME.

Tp ESTIMATED TIME.

CRITICAL ROUTE OPTIMAL TIME.

Tmp IT IS THE AMOUNT OF TIME THAT

AN ACTIVITY MAY TAKE TIME
(SHORTER).
4. Build the respective network.

ACTIVITY PRECEDENCE
A ---
B ---
C ---
D A
E B
F C
G C
H D,E
I D,E
J G
K H
L I, F
M J
N K,L

Solution:

NETWORK DIAGRAM
5 Build the graph according to the following table.

ACTIVITY PRECEDENCE
A ---
B ---
C ---
D ---
E B
F C
G E
H B
I H
J G
K F
L D
M L
N K
O H
P A,O,I

Solution:

GRAPHIC
6 Find the critical path according to the following exercise.

PRECEDENCE ACTIVITY To Tmp Tp You FREEDOM

A --- 1 4 6 4 0
B A 1 2 3 2 5
C A 1 1 2 1 0
D A 2 3 5 3 0
E B 1 1 1 1 0
F C 2 4 8 4 0
G D 1 2 4 2 0
H F,G 1 3 5 3 0
I E,H 10 15 18 15 0

GRAPH

Critical path:

Route 1: A–C–F–H–I

4 + 1 + 4 + 3 + 15 = 27

Route 2: A–D–G–H–I

4 + 3 + 2 + 3 + 15 = 27
 CONCLUSIONS

The preparation of this work allows us to conclude that

When applying the transportation method, the goal is to find a route of

distribution that optimizes the particular objective that has been established,
then it can be to minimize the total shipping cost, or minimize the
total time involved.

The allocation model is a special case of the transportation model, in

the resources are allocated one to one, so each resource must
to uniquely assign oneself to a particular activity or to the assigned one.

The CPM-PERT model is a method that has a very wide scope.

broad since it is flexible and adapts to any project, allows
identify the moments in the project when the constraints will cause
problems according to the flexibility allowed by the slack times
of the non-critical activities, it is also a tool for controlling and
monitor the progress of the project.

With the knowledge acquired in the METHODS course

DETERMINISTIC, we prepare to take responsibility as
future professionals having the ability to use different tools
of analysis that will allow us to create and apply solutions correctly
optimally benefiting the different companies where we can work or
the creation of our own companies.
 BIBLIOGRAPHY

Deterministic Methods Module

(Preliminary version)
Gloria Lucia Guzmán Aragón
National Open and Distance University - UNAD
Faculty of Basic Sciences and Engineering
Systems Engineering Program
Neiva (Huila), 2.005