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

x y z
MINIMIZE C = 4X+5Y+3 4 5 3
CONSTRAINTS:
4x+2y+3z=100 4 2 3 100
x ≥ 20 20
y≤6 6
z≥8 8
x,y,z ≥ 0

INITIAL TABLEAU
Cj 4 5 3 0 0 0 1000 1000 1000
Cont. soln qty 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
Cj-Zj -4996 -1995 -3997 1000 0 1000 0 0 0

Optimum column: Highest negative Pivot row:

-4996 25
-1995 20 lowest positive quotient
 x y z
MINIMIZE C = 4X+5Y+3 4 5 3
CONSTRAINTS:
4x+2y+3z=100 4 2 3 100
x ≥ 20 20
y≤6 6
z≥8 8
x,y,z ≥ 0

INITIAL TABLEAU
Cj 4 5 3 0 0 0 1000 1000 1000
Cont. soln qty 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
Cj-Zj -4996 -1995 -3997 1000 0 1000 0 0 0

Optimum column: Highest negative Pivot row:

-4996 25
-1995 20 lowest positive quotient
-3997 --
--
New values:
r2 (old) 20 1 0 0 0 -1 0 0 0
r2(new) 20 1 0 0 -1 0 0 0 0

New values:
r1 (old) 100 4 2 3 0 0 0 1 0
r2(new) 20 1 0 0 -1 0 0 0 0
r1 (new) 20 0 2 3 4 0 0 1 0

New values:
r3 (old) 6 0 1 0 0 1 0 0 0
r3(new) 6 0 1 0 0 1 0 0 0
 x y z
MINIMIZE C = 4X+5Y+3Z 4 5 3
CONSTRAINTS:
4x+2y+3z=100 4 2 3 100
x ≥ 20 20
y≤6 6
z≥8 8
x,y,z ≥ 0

INITIAL TABLEAU

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 4 th constraint z ≥ 8

And the artificial variable A3 appears in the basis with positive value 4/3.