FINAL EXAMINATION SOLUTIONS

1. Simplex Method
Minimize cost MIN C= 3X1 + 7X2 + 5X3
Subject to X1+ X2 +X3 ≥ 50

Reformulate: Min C = 3X1 + 7X2 + 5X3 + 0S1 + 0S2 + 0A1 + 0A2

1X1 + 1X2 + 1X3 – 1S1 + 0S2 + 1A1 + 0A2

2X1 + 3X2 + 1X3 + 0S1 – 1S2 + 0A1 + 1A2

Initial Tableau
Cj 3 7 5 0 0 1,000 1,000
Cont. Soln. Qty. X1 X2 X3 S1 S2 A1 A2 ETR
1,000 A1 50 1 1 1 -1 0 1 0 50
1,000 A2 100 2 3 1 0 -1 0 1 33.33
Zj 150,000 3,000 4,000 2,000 -1,000 -1,000 -1,000 -1,000
Cj-Zj -2,997 -3,993 -1,995 1,000 1,000 0 0
Second Tableau
Cj 3 7 5 0 0 1,000 1,000
Cont. Soln. Qty. X1 X2 X3 S1 S2 A1 A2 ETR
1,000 A1 16.67 0.33 0 0.67 -1 0.33 1 -0.33 25
7 X2 33.33 0.67 1 0.33 0 -0.33 0 0.33 100
Zj 16,900 334.69 7 901 -1,000 327.69 1,000 -327.29

Cj-Zj - 0 896 1,000 - 0 1,327.29

331.69 327.69
Third Tableau
Cj 3 7 5 0 0 1,000 1,000
Cont. Soln. Qty. X1 X2 X3 S1 S2 A1 A2 ETR
5 X3 25 0.5 0 1 -1.5 0.5 1.5 -0.5 50
7 X2 25 0.5 1 0 0.5 -0.5 -0.5 0.5 50
Zj 300 6 7 5 -4 -1 4 1
Cj-Zj -3 0 0 4 1 996 999
Fourth Tableau
Cj 3 7 5 0 0 1,000 1,000
Cont. Soln. Qty. X1 X2 X3 S1 S2 A1 A2 ETR
5 X3 0 0 -1 1 -2 1 2 -1 0
3 X1 50 1 2 0 1 -1 -1 1 -50
 Zj 150 3 1 5 -7 2 7 -2
Cj-Zj 0 6 0 7 -2 993 1,002
Final Tableau

3 X1 50 1 1 1 -1 0 1 0
Zj 150 3 3 3 -3 0 3 0
Cj-Zj 0 4 2 3 0 997 1,000
Solution is Optimal:

X1 = 50, X2 = 0, X3=0 MIN C= 3X1 + 7X2 + 5X3

MIN C= 3(50) + 7(0) + 5(0)
= 150

2. Transportation
Method
Distribution A(V1) B(V2) TC(V3) Supply
/Plants
1(W1) 15 21 14 1,500
2 (W2) 18 25 19 2,000
3 (W3) 22 16 20 3,000
4 (W4) 26 23 24 3,500
Demand 3,000 2,750 3,750
Table 1
Distribution A(V1) B(V2) C(V3) D(V4) Supply
/Plants
1(W1) 15 (1,500) 21 14 0 0
2 (W2) 18 (1,500) 25 (500) 19 0 3
3 (W3) 22 16 (2,250) 20 (750) 0 6
4 (W4) 26 23 24 (3,000) 0 (500) 10
Demand 15 10 14 -10
Table I: Transportation Cost
A1 (15 x 1,500) 22,500
A2 (18 x 1,500) 27,000
B2 (25 x 500) 12,500
B3 (16 x 2,250) 36,000
C3 (20 x 750) 15,000
 C4 (24 x 3,000) 72,000
D4 (0 x 500) 0
Total 185,000
Occupied Cell
A2 : 18 + 0 = 18 V1: 18 - 0 = 18
B2 : 25 + 0 = 25 V2: 25 - 0 = 25
B3 : 25 - 9 = 16 W3: 16 - 25 = -9
C3 : 29 – 9 = 20 V3: 20 - (-9) = 29
C4 : 29 – 5 = 24 W4: 24 - 29 = -5
D4 : 5 – 5 = 0 V4: 0 - (-5) = 5
A1 : 18 – 3 = 15 W1: 15 - 18 = -3
Unoccupied cell:
B1 : 21 - ( -3 + 25 ) -1
C1 : 14 - ( -3 + 29 ) -12
D1 : 0 - ( -3 + 5 ) -2
C2 : 19 - ( 0 + 29 ) -10
D2 : 0 - ( 0 + 5 ) -5
A3 : 22 - ( -9 + 18 ) 13
D3 : 0 - ( -9 + 5 ) 4
A4: 26 - ( -5 + 18 ) 13
B4 : 23 - ( -5 + 25 ) 3
Table 2
Distribution A(V1) B(V2) C(V3) D(V4) Supply
/Plants
1(W1) 15 (1,000) 21 14 (500) 0 0
2 (W2) 18 (2,000) 25 19 0 3
3 (W3) 22 16 (2,750) 20 (250) 0 6
4 (W4) 26 23 24 (3,000) 0 (500) 10
Demand 15 10 14 -10
Table 2: Transportation Cost
A1 : ( 15 x 1,000) 15,000
C1 : (14 x 500) 7,000
A2 : (18 x 2,000) 36,000
B3: (16 x 2,750) 44,000
C3 : (20 x 250) 5,000
C4 : (24 x 3,000) 72,000
D4 : (0 x 500) 0
Total 179,000
Occupied Cell
 A1 : 15 + 0 = 15 V1: 15 - 0 = 15
C1: 14 + 0 = 0 V3: 14 - 0 = 14
A2: 15 + 3 = 18 W2: 18 - 15 = 3
C3: 14 + 6 = 20 W3: 20 - 14 = 6
C4: 14 + 10 = 24 W4: 24 - 14 = 10
D4: -10 + 10 = 0 V4: 0 - 10 = -10
3: 10 + 6 = 16 V2: 16 - 6 = 10
Unoccupied cell:

B1 : 21 - ( 0 + 10 ) 11
D1 : 0 - ( 0 + (-10) ) 10
B2 : 25 - ( 3 + 10 ) 12
C2 : 19 - ( 3 + 14 ) 2
D2 : 0 - ( 3 + (-10) ) 7
A3 : 22 - ( 6 + 15 ) 1
D3 : 0 - ( 6 + (-10) ) 4
A4 : 26 - ( 10 + 15 ) 1
B4 : 23 - ( 10 + 10 ) 3

Table 3

Machines A B C D E
1 16 0 14 8 34
2 0 0 34 20 0
Distribution A B C D Supply
/Plants
1(D1) 15 (1,000) 21 (0) 14 (500) 0 (0) 1,500
2 (D2) 18 (2,000) 25 (0) 19 (0) 0 (0) 2,000
3 (D3) 22 (0) 16 (2,750) 20 (250) 0 (0) 3,000
4 (D4) 26 (0) 23 (0) 24 (3,000) 0 (500) 3,500
Demand 3,000 2,750 3,750 0
Optimal Value : 179,000
3. Assignment Method
Machines A B C D E
1 74 52 66 64 90
2 50 44 78 68 48
3 62 70 52 56 72
4 84 36 56 80 46
5 58 38 76 54 84
Machines A B C D E
1 22 0 14 12 38 -52
2 6 0 34 24 4 -44
3 10 18 0 4 20 -52
4 48 0 20 44 10 -36
5 20 0 38 16 46 -38
3 4 18 0 0 16
4 42 0 20 40 6
5 14 0 38 12 42
-6 -4 -4
Machines A B C D E
1 16 0 14 8 34
2 (x) 0 0 34 20 0
3 (x) 4 18 0 0 16
4 42 0 20 40 6
5 14 0 38 12 42
Machines A B C D E
1 8 0 6 0 26
2 0 8 34 20 0
3 4 26 0 0 16
4 36 2 14 34 0
5 6 0 30 4 34
Machines A B C D E
1 74 52 66 64 90
2 50 44 78 68 48
3 62 70 52 56 72
4 84 36 56 80 46
5 58 38 76 54 84
Optimal Value : 250