Linear-Programming Simplex-Max-Method
Linear-Programming Simplex-Max-Method
Table 1
Cj 25 23 18 0 0 0
Prod Qty X1 X2 X3 S1 S2 S3
0 S1 42000 60 60 0 1 0 0
0 S2 24000 40 20 20 0 1 0
0 S3 36000 0 60 60 0 0 1
Zj
Cj - Zj
Solution:
Computing Zj row values:
0 x (42000 60 60 0 1 0 0) = 0 0 0 0 0 0 0
0 x (24000 40 20 20 0 1 0) = 0 0 0 0 0 0 0
0 x (36000 0 60 60 0 0 1) = 0 0 0 0 0 0 0
Zj = 0 0 0 0 0 0 0
Solution:
Maximize : P = 25X1 + 23X2 + 18X3 + 0 S1 + 0 S2 + 0 S3
Subject to : 60X1 + 60X2 + S1 = 42000
40X1 + 20X2 + 20X3 + S2 = 24000
60X2 + 60X3 + S3 = 36000
X1, X2, X3, S1, S2, S3 ≥0
Outgoing variable Entering variable
Table 1
Cj 25 23 18 0 0 0
Prod Qty X1 X2 X3 S1 S2 S3
0 S3 36000 0 60 60 0 0 1
Zj 0 0 0 0 0 0 0
Cj - Zj 25 23 18 0 0 0
Solution:
Table 2
Cj 25 23 18 0 0 0
Prod Qty X1 X2 X3 S1 S2 S3
0 S1
25 X1
0 S3
Zj
Cj - Zj
Solution:
NR2 = OR2 / 40 = 24000 40 20 20 0 1 0
40
NR2 = 600 1 ½ ½ 0 1/40 0
NR3 = OR3
NR3 = 36000 0 60 60 0 0 1
ZJ = 25 x (600 1 ½ ½ 0 1/40 0)
= 15000 25 12 ½ 12 ½ 0 5/8 0
Solution:
Zj 15000 25 12 ½ 12 ½ 0 5/8 0
Cj - Zj 0 10 ½ 5½ 0 -5/8 0
Solution:
Table 3
Cj 25 23 18 0 0 0
Prod Qty X1 X2 X3 S1 S2 S3
23 X2
25 X1
0 S3
Zj
Cj - Zj
Solution:
NR1 = OR1 / 30 = 6000 0 30 -30 1 -1 ½ 0
30
NR1 = 200 0 1 -1 1/30 -1/20 0
Cj - Zj 0 0 16 -7/60 - 1/10 0
Solution:
Table 4
Cj 25 23 18 0 0 0
Prod Qty X1 X2 X3 S1 S2 S3
23 X2
25 X1
18 X3
Zj
Cj - Zj
Solution:
NR3 = OR3 / 120 = 24000 0 0 120 -2 3 1
120
NR3 = 200 0 0 1 -1/60 1/40 1/120
Table 4
Cj 25 23 18 0 0 0
Prod Qty X1 X2 X3 S1 S2 S3
Conclusion:
The maximum profit PNC refinery can obtain from shipment is P 20,300 which is
obtained by producing 400 liters of regular gas, 300 liters of premium, and 200
liters of diesel.