PROBLEM B1

Initial Tableau
0.05 0.06 0 0 0 0 1000 1000 1000 1000
Cont. Soln. Qty. X Y S1 S2 S3 S4 A1 A2 A3 A4
1000 A1 50 5 25 -1 0 0 0 1 0 0 0
1000 A2 100 25 10 0 -1 0 0 0 1 0 0
1000 A3 60 10 10 0 0 -1 0 0 0 1 0
1000 A4 180 36 20 0 0 0 -1 0 0 0 1

Z=390,000 Zj 76,000 65,000 -1000 -1000 -1000 -1000 1000 1000 1000 1000

Cj-Zj -76,000.05 -65,000.06 1000 1000 1000 1000 0 0 0 0

Second Tableau
0.05 0.06 0 0 0 0 1000 1000 1000 1000
Cont. Soln. Qty. X Y S1 S2 S3 S4 A1 A2 A3 A4
1000 A1 30 0 23 -1 1/5 0 0 1 -1/5 0 0
0.05 X 4 1 2/5 0 -1/25 0 0 0 1/25 0 0
1000 A3 20 0 6 0 2/5 -1 0 0 -2/5 1 0
1000 A4 36 0 28/5 0 36/25 0 -1 0 -36/25 0 1
Z=86,000.2 Zj 0.05 34,600.02 -1000 2040 -1000 -1000 1000 -2040 1000 1000

Cj-Zj 0 -34,600 1000 -2040 1000 1000 0 3040 0 0

Third Tableau
0.05 0.06 0 0 0 0 1000 1000 1000 1000
Cont. Soln. Qty. X Y S1 S2 S3 S4 A1 A2 A3 A4
0.06 Y 30/23 0 1 -1/23 1/115 0 0 1/23 -1/115 0 0
0.05 X 80/23 1 0 2/115 -1/23 0 0 -2/115 1/23 0 0
1000 A3 280/23 0 0 6/23 8/23 -1 0 -6/23 -8/23 1 0
1000 A4 660/23 0 0 28/115 32/23 0 -1 - -32/23 0 1
28/115
Z= 40,870 Zj 0.05 0.06 504.4 1,739.13 -1000 -1000 -504.4 - 1000 1000
1739.1
3
Cj-Zj 0 0 -504.4 -1,739.13 1000 1000 1504.4 2739.1 0 0
3
Fourth Tableau
0.05 0.06 0 0 0 0 1000 1000 1000 1000
Cont. Soln. Qty. X Y S1 S2 S3 S4 A1 A2 A3 A4
0.06 Y 9/8 0 1 -0.045 0 0 1/160 0.045 0 0 -1/160
0.05 X 35/8 1 0 1/40 0 0 -1/32 -1/40 0 0 1/32
1000 A3 5 0 0 1/5 0 -1 1/4 -1/5 0 1 -1/4
0 S2 165/8 0 0 7/40 1 0 -23/32 -7/40 -1 0 23/32
Z=5,000.286 Zj 0.05 0.06 200 0 -1000 250 -200 0 1000 -250
2
Cj-Zj 0 0 -200 0 1000 -250 1200 1000 0 1250

Fifth Tableau
0.05 0.06 0 0 0 0 1000 1000 1000 1000

Cont. Soln. Qty. X Y S1 S2 S3 S4 A1 A2 A3 A4

0.06 Y 1 0 1 -0.05 0 1/40 0 0.05 0 -1/40 0

0.05 X 5 1 0 1/20 0 -1/8 0 -1/20 0 1/8 0

0 S4 20 0 0 4/5 0 -4 1 -4/5 0 4 -1

0 S2 35 0 0 3/4 1 -23/8 0 -3/5 -1 23/8 0

Z= 0.31 Zj 0.05 0.06 -0.0005 0 -0.0048 0 0.0005 0 0.0048 0

Cj-Zj 0 0 0.0005 0 0.0048 0 999.99 1000 999.995 1000

9
MIN Z = 0.05x1 + 0.06x2

subject to

5x1 + 25x2 >= 50

25x1 + 10x2 >= 100
10x1 + 10x2 >= 60
36x1 + 20x2 >= 180
x1,x2 >= 0

Reformulate:

C= 0.05x + 0.06y + 0S1 + 0S2 + 0S3 + 0S4 + 1000A1 + 1000A2 + 1000A3 + 1000A4
5x + 25y – 1S1 + 0S2 + 0S3 + 0S4 + 1A1 + 0A2 + 0A3 + 0A4 = 50
25x + 10y + 0S1 - 1S2 + 0S3 + 0S4 + 0A1 + 1A2 + 0A3 + 0A4 = 100
10x + 10y + S1 + 0S2 - 1S3 + 0S4 + 0A1 + 0A2 + 1A3 + 0A4 = 60
36x + 20y + 0S1 + 0S2 + 0S3 - 0S4 + 0A1 + 0A2 + 0A3 + 1A4 = 180

Decision:
Since there is no more negative values in the Cj-Zj column, no further improvement is possible.

Hence,

X= 5
Y= 1
MIN Z = 0.31
Simplex Algorithm TABLE 2
100/25 = 4 lowest NEW A1 NEW A3 NEW A4
quotient
100/25 = 4 50-(5x4) =30 60-(10x4) =20 180-(36x4) =36
25/25 = 1 5-(5x1) =0 10-(10x1) =0 36-(36x1) =0
10/25 = 2/5 25-(5x2/5) = 23 10-(10x2/5) =6 20-(36x2/5) =28/5
0/25 = 0 -1-(5x0) = -1 0-(10x0) =0 0-(36x0) =0
-1/25 = -1/25 0-(5x-1/25) = 1/5 0-(10x-1/25) =2/5 0-(36x-1/25) =36/25
0/25 = 0 0-(5x0) =0 -1-(10x0) =-1 0-(36x0) =0
0/25 = 0 0-(5x0) = 0 0-(10x0) =0 -1-(36x0) =-1
0/25 = 0 1-(5x0) = 1 0-(10x0) =0 0-(36x0) =0
1/25 = 1/25 0-(5x1/25) = -1/5 0-(10x1/25) =-2/5 0-(36x1/25) =-36/25
0/25 = 0 0-(5x0) = 0 1-(10x0) =1 0-(36x0) =0
0/25 = 0 0-(5x0) = 0 0-(10x0) =0 1-(36x1) =1

Simplex Algorithm TABLE 3

NEW X NEW A3 NEW A4
30/23 = 30/23 4-(2/5x30/23) = 80/23 20-(6x30/23) = 280/23 36-(28/5x30/23) = 660/23
0/23 = 0 1-(2/5x0) = 1 0-(6x0) = 0 0-(28/5x0) = 0
23/23 = 1 2/5-(2/5x1) = 0 6-(6x1) = 0 28/5-(28/5x1) = 0
-1/23 = -1/23 0-(2/5x-1/23) = 2/115 0-(6x-1/23) = 6/23 0-(28/5x-1/23) = 28/115
1/5/23 = 1/115 -1/25-(2/5x1/115) = -1/23 2/5-(6x1/115) = 8/23 36/25-(28/5x1/115) = 32/23
0/23 = 0 0-(2/5x0) = 0 -1-(6x0) = -1 0-(28/5x0) = 0
0/23 =0 0-(2/5x0) = 0 0-(6x0) = 0 -1-(28/5x0) = -1
1/23 = 1/23 0-(2/5x1/23) = -2/115 0-(6x1/23) = -6/23 0-(28/5x1/23) = -28/115
-1/5/23 = -1/115 1/25-(2/5x-1/115) = 1/23 -2/5-(6x-1/115) = -8/23 -36/25-(28/5x-1/115) = 32/23
0/23 = 0 0-(2/5x0) = 0 1-(6x0) = 1 0-(28/5x0) = 0
0/23 = 0 0-(2/5x0) = 0 0-(6x0) = 0 1-(28/5x0) = 1

Simplex Algorithm TABLE 4

New Y New X New A3
660/23/32/23 = 30/23 – (1/115(165/8)) = 9/8 80/23 – (-1/23(165/8)) = 35/8 280/23 – (8/23(165/8)) = 5
165/8
0/32/23 = 0 0 – (1/115(0)) = 0 1 – (-1/23(0)) = 1 0 – (8/23(0)) = 0
0/32/23 = 0 1 – (1/115(0)) = 1 0 – (-1/23(0)) = 0 0 – (8/23(0)) = 0
28/115/32/23 = -1/23 – (1/115(7/40)) = -9/200 2/115 – (-1/23(7/40)) = 1/40 6/23 – (8/23(7/40)) = 1/5
-7/40
32/23/32/23 = 1 1/115 – (1/115(1)) = 0 -1/23 – (-1/23(1)) = 0 8/23 – (8/23(1)) = 0
0/32/23 = 0 0 – (1/115(0)) = 0 0 – (-1/23(0)) = 0 -1 – (8/23(0)) = -1
-1/32/23 = -23/32 0 – (1/115(-23/32)) = 1/160 0 – (-1/23(-23/32)) = -1/32 0 – (8/23(-23/32)) = 1/4
-28/115/32/23 = 1/23 – (1/115(-7/40)) = 9/200 -2/115 – (-1/23(-7/40)) = -1/40 -6/23 – (8/23(-7/40)) = -1/5
-7/40
-32/23/32/23 = -1 -1/115 – (1/115( -1)) = 0 1/23 – (-1/23(-1)) = 0 -8/23 – (8/23(-1)) = 0
0/32/23 = 0 0 – (1/115(0)) = 0 0 – (-1/23(0)) = 0 0 – (8/23(0)) = 1
1/32/23 = 23/32 0 – (1/115(23/32)) = -1/160 0 – (-1/23(23/32)) = -1/32 1 – (8/23(23/32)) = -1/4

Simplex Algorithm TABLE 5

5/1/4 = 20 9/8 – (1/160(20)) = 1 35/8 (-1/32(20)) = 5 165/8 – (-23/32(20)) = 35
0/1/4 = 0 0 – (1/160(0)) = 0 1 (-1/32(0)) = 1 0 – (-23/32(0)) = 0
0/1/4 = 0 1 – (1/160(0)) = 1 0 (-1/32(0)) = 0 0 – (-23/32(0)) = 0
1/5/1/4 =4/5 -9/200 – (1/160(4/5)) = -1/20 1/40 (-1/32(4/5)) = 1/20 7/40– (-23/32(4/5)) = 3/4
0/1/4 = 0 0 – (1/160(0)) = 0 0 (-1/32(0)) = 0 1 – (-23/32(0)) = 1
-1/1/4 =-4 0 – (1/160(-4)) = 1/40 0 (-1/32(-4)) = -1/8 0 – (-23/32(-4)) = -23/8
1/4 /1/4 = 1 1/160 – (1/160(1)) = 0 -1/32 (-1/32(1)) = 0 -23/32 – (-23/32(1)) = 0
-1/5/1/4 = -4/5 9/200 – (1/160(-4/5)0 = 1/20 -1/40 (-1/32(-4/5)) = -1/20 -7/40 – (-23/32(-4/5)) = -3/4
0/1/4 = 0 0 – (1/160(0)) = 0 0 – (-1/32(0)) = 0 -1 – (-23/32(0)) = -1
1/1/4 = 4 0 – (1/160(4)) = -1/40 0 – (-1/32(4)) = 1/8 0 – (-23/32(4)) = 23/8
-1/4/1/4 = -1 -1/160 – (1/160(-1)) = 0 1/32 – (-1/32(-1)) = 0 23/32 – (-23/32(-1)) = 0

Solution to problem B4
Minimize C=4x+5y+3z
Subject to:
4x+2y+3z=100
x ≥ 20
y≤6
z≥8
x,y,z ≥ 0

reformulate:
Min C=4x+5y+3z+0S1+0S2+0S3+1000A1+1000A2+1000A3
4x+2y+3z+0S1+0S2+0S3+1A1+0A1+0A3=100
1x+0y+0z-1S1+0S2+0S3+0A1+1A1+0A3=20
0x+1y+0z+0S1+1S2+0S3+0A1+0A1+0A3=6
0x+0y+1z+0S1+0S2-1S3+0A1+0A1+1A3=8

INITIAL TABLEAU
Cj 4 5 3 0 0 0 1000 1000 1000
C o n t. so ln q ty x y z s1 s2 s3 a1 a2 a3 ETR
1000 a1 100 4 2 3 0 0 0 1 0 0 25
1000 a2 20 1 0 0 -1 0 0 0 1 0 20
0 s2 6 0 1 0 0 1 0 0 0 0 --
1000 a3 8 0 0 1 0 0 -1 0 0 1 --
Zj 128000 5000 2000 4000 -1000 0 -1000 1000 1000 1000
C j-Zj -4996 -1995 -3997 1000 0 1000 0 0 0

O p tim u m c o lu mn : Hig h e st n e g a tiv e Piv o t ro w :

-4996 25
-1995 20 lo w e st p o sitiv e q u o tie n t
-3997 --
--
Ne w v a lu e s:
r2 (o ld ) 20 1 0 0 0 -1 0 0 0
r2(n e w ) 20 1 0 0 -1 0 0 0 0

Ne w v a lu e s:
r1 (o ld ) 100 4 2 3 0 0 0 1 0
r2(n e w ) 20 1 0 0 -1 0 0 0 0
r1 (n e w ) 20 0 2 3 4 0 0 1 0

Ne w v a lu e s:
r3 (o ld ) 6 0 1 0 0 1 0 0 0
r3(n e w ) 6 0 1 0 0 1 0 0 0

Ne w v a lu e s:
r4 (o ld ) 8 0 0 1 0 0 -1 0 1
r4(n e w ) 8 0 0 1 0 0 -1 0 1

SEC O ND TABLEAU
Cj 4 5 3 0 0 0 1000 1000
C o n t. so ln q ty x y z s1 s2 s3 a1 a3 ETR
1000 a1 20 0 2 3 4 0 0 1 0 6.667
4 x 20 1 0 0 -1 0 0 0 0 --
0 s2 6 0 1 0 0 1 0 0 0 --
1000 a3 8 0 0 1 0 0 -1 0 1 8
Zj 28080 4 2000 4000 3996 0 -1000 1000 1000
C j-Zj 0 -1995 -3997 -3996 0 1000 0 0

O p tim u m c o lu mn : Hig h e st n e g a tiv e Piv o t ro w :

0 6.67 lo w e st p o sitiv e q u o tie n t
-1995 --
-3997 --
8
Ne w v a lu e s:
r1 (o ld ) 20 0 2 3 4 0 0 0
r1(n e w ) 6 2/ 3 0 2/ 3 1 1 1/ 3 0 0 0

Ne w v a lu e s:
r2 (o ld ) 20 1 0 0 -1 0 0 0 0
r2(n e w ) 20 1 0 0 -1 0 0 0 0

Ne w v a lu e s:
r3 (o ld ) 6 0 1 0 0 1 0 0 0
r3(n e w ) 6 0 1 0 0 1 0 0 0

Ne w v a lu e s:
r4 (o ld ) 8 0 0 1 0 0 -1 1
r1(n e w ) 6 2/ 3 0 2/ 3 1 1 1/ 3 0 0 0
r4 (n e w ) 1 1/ 3 0 - 2/ 3 0 -1 1/ 3 0 -1 1
FINAL TABLEAU
Cj 4 5 3 0 0 0 1000
C o n t. so ln q ty x y z s1 s2 s3 a3
3 z 6 2/ 3 0 2/ 3 1 1 1/ 3 0 0 0
4 x 20 1 0 0 -1 0 0 0
0 s2 6 0 1 0 0 1 0 0
1000 a3 1 1/ 3 0 - 2/ 3 0 -1 1/ 3 0 -1 1
Zj 1433 1/ 3 4 -664 2/ 3 3 -1333 1/ 3 0 -1000 1000
C j-Zj 0 669 2/ 3 0 1333 1/ 3 0 1000 0

Decision:
Since there is no more negative values in the Cj-Zj column, no further improvement is possible.
X=20
Y=0
Z=20/3

Minimal C=100

*But this solution is not feasible because it violates the 4th constraint z ≥ 8
And the artificial variable A3 appears in the basis with positive value 4/3.