ECON 85

Operations Research
ASSIGNMENT NO 6 (Transportation and Assignment Problems)

1) A company has three plants producing a certain product that is to be shipped to four
distribution centers. Plants 1, 2, and 3 produce 12, 17, and 11 shipments per month,
respectively. Each distribution center needs to receive 10 shipments per month. The
distance from each plant to the respective distributing centers is given below in milers:
(25 points)
Distribution Center
1 2 3 4
1 800 1,300 400 700
Plant 2 1,100 1,400 600 1,000
3 600 1,200 800 900

The freight cost for each shipment is $100 plus 50 cents per mile. How much should be
shipped from each plant to each of the distribution centers to minimize the total
shipping costs? Use the three approaches in solving for the optimal solution.

ANSWER:

DISTRIBUTION CENTER

1 2 3 4 SUPPLY
10 2
1 800 1,300 400 700 12, 2 =0
PLANTS 2 1,100 8
1,400
9
600 1,000 17 , 9 =0
3 600 1,200 1
800
10
900 11 , 10 =0
DEMAND 10 =0 10 , 8 =0 10 , 1 =0 10 =0 TOTAL =40
 (10 x 800) + (2 x 1,300) + (8 x 1,400) + (9 x 600) + (1 x 800) + (10 x 900) = 37,000

II. LEAST COST CELL METHOD

DISTRIBUTION CENTER
1 2 3 4 SUPPLY
1 800 1,300 10
400
2
700 12, 2 =0

PLANTS 2 1,100 10
1,400 600 7
1,000 17 , 10 =0
3 10
600 1,200 800 1
900 11 , 7 =0
DEMAND 10 =0 10 =0 10 =0 10 , 8 , 7
=0

(10 x 400) + (2 x 700) + (10 x 1,400) + (7 x 1,000) + (10 x 600) + (1 x 900) = 33,300
 2) The coach of a certain swim team needs to assign swimmers to a 200-yard medley team
to send to the Junior Olympics. Since most of his best swimmers are very fast in more
than one stroke, it is not clear which swimmer should be assigned to each of the four
strokes. The five fastest swimmers and the “best times” (in seconds) they have achieved
in each of the strokes (for 50 yards) are: (25 points)

Swimmer
Stroke Carl Chris David Tony Ken
Backstroke 37.7 32.9 33.8 37.0 35.4
Breaststroke 43.4 33.1 42.2 34.7 41.8
Butterfly 33.3 28.5 38.9 30.4 33.6
Freestyle 29.2 26.4 29.6 28.5 31.1

The coach wishes to determine how to assign four swimmers to the four different
strokes to minimize the sum of the corresponding “best times”. Formulate this problem as an
assignment problem and solve for the optimal solution.

ANSWER:

SWIMMER
CARL CHRIS DAVID TONY KEN
1 37.7 32.9 33.8 37.0 35.4
2 43.4 33.1 42.2 34.7 41.8
STROKE 3 33.3 28.5 38.9 30.4 33.6
4 29.2 26.4 29.6 28.5 31.1
5 DUMMY 0 0 0 0 0

1 2 3 4 5
DUMMY
A CARL 37.7 43.4 33.3 29.2 0
B CHRIS 32.9 33.1 28.5 26.4 0
C DAVID 33.8 42.2 38.9 29.6 0
D TONY 37.0 34.7 30.4 28.5 0
E KEN 35.40 41.8 33.6 31.1 0
COLUM 32.9 33.1 28.5 26.4 0
MIN.
NEW VALUE:

1 2 3 4 5
A 4.8 10.3 4.8 2.8 0
B 0 0 0 0 0
C 0.9 9.1 10.4 3.2 0
D 4.1 1.6 1.9 2.1 0
E 2.5 8.7 5.1 4.7 0

PHASE 2:

1 2 3 4 5 NO. OF
SQUARE
A 4.8 10.3 4.8 2.8 0 2≠5

B 0 0 0 0 0
C 0.9 9.1 10.4 3.2 0
D 4.1 1.6 1.9 2.1 0
E 2.5 8.7 5.1 4.7 0

NEW MATRIX ROW AND COLUM SCANNING

1 2 3 4 5 NO. OF
SQUARE
A 3.9 9.4 3.9 1.9 0 3≠5

B 0 0 0 0 0.7
C 0 8.2 9.5 2.3 0
D 3.2 0.7 1.0 1.2 0
E 1.6 7.8 9.7 3.8 0

1 2 3 4 5 NO. OF
SQUARE
A 3.9 8.7 2.9 0.9 0 5≠5

B 1.0 0.3 0 0 1.9

C 0 6.6 7.6 0.4 0
D 4.1 0 0 0.2 0.9
E 1.6 6.2 2.3 1.9 0
 1 2 3 4 5 NO. OF
SQUARE
A 3.9 8.7 3.2 1.2 0 4≠5

B 0.7 0 0 0 1.6
C 0 7.5 8.8 1.6 0
D 3.2 0 0.3 0.5 0
E 1.6 7.1 3.5 3.1 0

OPTIMAL SOLUTION:

SWIMMER STOKES TIME

CARL FREESTYLE 29.2
CHRIS BUTTERFLY 28.5
DAVID BACKSTROKE 33.8
TONY BREAST STROKE 34.7
KEN (DUMMY) -
 Cavite State University
College of Economics, Management and Development Studies
DEPARTMENT OF ECONOMICS

III-BS Economics Dr. Gilchor P. Cubillo

First Semester, AY 2020-2021 Professor

ECON 85
Operations Research
ASSIGNMENT NO. 7 ( NETWORK ANALYSIS )

1) For networks (a) and (b), find the maximal flow from the source to the sink, given that
the flow capacity from node I to node j is the number along branch (ij) nearest node i.
(20 points)

2 4
a) 0 0
6 2 5 4 5
Flow 1 0 3 1 0 7 Flow
Source 4 3 0
Sink 1 3
0 9
2 6
0 4 4 0
ANSWER:
1ST ITERATION

2ND ITERATION

3RD ITERATION
4TH ITERATION

ILLUSTRATION:

FINAL ANSWER
PATH FLOW
1-2–5–7 4
1–3–6–7 1
1–3–4–6–7 1
1–4–6-7 1
TOTAL 9
 2 4 4
7 0
2 3 3 7
0 2 2 7
b) Flow 8 3 3
5 0 Flow
1 1 3 0 5 8 0 9
Source 9 0 3 0 Sink
4 48
0 3 6 1 8 7
3 0

2 6 2

ANSWER:

1ST ITERATION
2ND ITERATION

3RD ITERATION

4TH ITERATION
5TH ITERATION

6TH ITERATION

7TH ITERATION
ILLUSTRATION:

FINAL ANSWER
PATH FLOW
1-2–4–7–9 4
1–2–7–9 3
1–2–5–9 1
1–5–9 3
1–3–6–8–9 2
1–3–5–9 3
1–3–8–9 4
TOTAL 20
2) Consider the following project network. Assume that the time required (in weeks) for
each activity is a predictable constant and that it is given by the number along the
corresponding branch. Find the earliest time, latest time, and slack for each event. Also
identify the critical path. (30 points)

4 3

2 5 8
6 4 6

1 3 3 7 6 10

5 4 3 5

4 6 7 2 9
 11
ANSWER:
10

I
D 4 3 14
7
14
6
2 E 5 8 8
A 6 10 4 6
3 M
3 10 J 20
3
LST 0 1 B 33 3 F 7 6 10 20
EST 0
K
C 5 4 3 5
G N

H 6 7 L 2 9 15
4
6 13 13

5 11

ESj = Max (Esi + Dij) LSj = LC10 – D 9, 10

NODE 1 ESi = 0 NODE 10 LSJ =20
NODE 2 0 + 6=6 NODE 9 20 – 5= 15
NODE 3 0 + 3=3 NODE 8 20 – 6= 14
NODE 4 0 + 5=5 NODE 7 15 – 2= 13
NODE 5 6 + 4=10 NODE 6 14 – 4= 10
NODE 6 3 + 7=10 15 – 3= 12
5 + 4=9 NODE 5 14 – 3= 11
NODE 7 5 + 6=11 NODE 4 10 – 4= 6
NODE 8 10 + 3=13 13 – 6= 7
6 + 5=11 NODE 3 10 – 7= 3
10 + 4=14 NODE 2 11 – 4= 7
NODE 9 10 + 3=13 14 – 5= 9
11 + 2=13 NODE 1 6 – 6= 0
NODE 10 14 + 6=20 3 – 3= 0
ACTIVITY 13 + 5=18
DURATION TOTAL FLOAT 5 – 5= 0 FREE FLOAT
(ί, ϳ) ( D ί ϳ) (TF ί ϳ) (FF ί ϳ)
 A 1-2 6 1 0
B 1-3 3 0 0
C 1-4 5 1 0
D 2-5 4 1 0
E 2-8 5 3 3
F 3-6 7 0 0
G 4-6 4 1 1
H 4-7 6 2 0
I 5-8 3 1 1
J 6-8 4 0 0
K 6-9 3 2 0
L 7-9 2 2 0
M 8-10 6 0 0
N 9-10 5 2 2
SUMMARY OF TOTAL FLOATS AND FREE FLOATS

TOTAL FLOAT
A 1-2 7 – 0 – 6=1 FREE FLOAT
B 1-3 3 – 0 – 3=0 A 1-2 6 – 0 – 6=0
C 1-4 6 – 0 – 5=1 B 1-3 3 – 0 – 3=0
D 2-5 11 – 6 – 4=1 C 1-4 5 – 0 – 5=0
E 2-8 14 – 6 -5=3 D 2-5 10 – 6 – 4=0
F 3-6 10 – 3 – 7=0 E 2-8 14 – 6 – 5=3
G 4-6 10 – 5 – 4=1 F 3-6 10 – 3 – 7=0
H 4-7 13 – 5 – 6=2 G 4-6 10 – 5 – 4=1
I 5-8 14 – 10 -3=1 H 4-7 11 – 5 – 6=0
J 6-8 14 – 10 – 4=0 I 5-8 14 – 10 – 3=1
K 6-9 15 – 10 – 3=2 J 6-8 14 – 10 – 4=0
L 7-9 15 – 11 – 2=2 K 6-9 13 – 10 – 3=0
M 8-10 20 – 14 – 6=0 L 7-9 13 – 11 – 2=0
N 9-10 20 – 13 – 5=2 M 8-10 20 – 14 – 6=0
N 9-10 20 – 13 – 5=2
CONDITION FOR CRITICAL PATH:
CRITICAL PATH:

ESi = LCj 1 – 3 – 6 – 8 – 10

ESj = LCj A–B–F–J–M

ESj – Esi = LCj – Lci = Dij

 Cavite State University
College of Economics, Management and Development Studies
DEPARTMENT OF ECONOMICS

III-BS Economics Dr. Gilchor P. Cubillo

First Semester, AY 2020-2021 Professor

ECON 85
Operations Research
ASSIGNMENT NO. 8 (Game Problems)

1) For each of the following payoff tables, determine the optimal strategy for each player
by successively eliminating dominated strategies. (Indicate the order in which you
eliminated strategies). (20 points)
a) Player II
Strategy 1 Strategy 2 Strategy 3
Strategy 1 -3 1 2
Player I Strategy 2 1 2 1
Strategy 3 1 0 -2
ANSWER!
PLAYER II

Strategy 1 Strategy 2 Strategy 3 ROW MIN.
PLAYER I
Strategy 1 -3 1 2 -3
Strategy 2 1 2 1 1 MAXIMIN
Strategy 3 1 0 -2 -2
COLUM 1 2 2
MINIMAX

MAXIMIN = MAXIMAX PLAYER I [0, 1, 0]
1=1 PLAYER II [1, 0, 0]

PLAYER II
PLAYER I
Strategy 1 Strategy 2 Strategy 3 TOTAL
Strategy 1 -3 1 2 0
Strategy 2 1 2 1 4 LEAST
VALUE Strategy 3 1 0 -2 -1
 PLAYER II
Strategy 1 Strategy 2 Strategy 3
Strategy 1 -3 1 2
PLAYER Strategy 2 1 = VALUE 2 1 I
-2 3 3= GRATER THAN

 PLAYER I [0, 1, 0]
PLAYER II [1, 0, 0]
V=1

b) Player II
Strategy 1 Strategy 2 Strategy 3
Strategy 1 0 4 1
Player I Strategy 2 -1 -2 3
Strategy 3 1 3 2

ANSWER:
PLAYER II

Strategy 1 Strategy 2 Strategy 3 ROW MIN.

Strategy 1 0 4 1 0
PLAYER I Strategy 2 -1 -2 3 -2
Strategy 3 1 = VALUE 3 2 1
COLUM 1 4 3
MINIMAX

 MAXIMIN = MAXIMAX PLAYER I [0, 0, 1]

1=1 PLAYER II [1, 0, 0]
V= 1
 PLAYER II
Strategy 1 Strategy 2 Strategy 3
Strategy 1 0 4 1
Strategy 2 -1 -2 3
PLAYER I Strategy 3 1 3 2
GREATER THAN 0 5 6
COLUM

PLAYER II
Strategy 1 Strategy 2 LESS
THAN
ROW
Strategy 1 0 4 4
PLAYER I Strategy 2 -1 -2 -3
Strategy 3 1 3 4

 PLAYER I = [0, 0, 1]
 PLAYER II = [1, 0, 0]
 V= 1

2) For each of the following payoff tables, transform the problem of finding the minimax
mixed strategies into an equivalent linear programming problem. (30 points)
 a) Player II
Strategy 1 Strategy 2 Strategy 3
Strategy 1 5 3 2
Player I Strategy 2 3 -2 3
Strategy 3 2 6 -1

b) Player II
S1 S2 S3 S4 S5
 Strategy 1 -3 -6 5 -2 3
Player I Strategy 2 -1 4 -4 1 -2
Strategy 3 0 -2 -5 -3 1
Strategy 4 2 -3 0 2 -4