Homework Sourseuse the simplex method to solve the given maximum problem ma
use the simplex method to solve the given maximum problem maximize
2 x1 + x2 + 6 x3
subject to the constraints
Solution
x1 x2 x3 s1 s2 s3 s4 s5 p
----------------------------------------------------------------------------
1 0 1 1 0 0 0 0 0 25
3 0 6 0 1 0 0 0 0 30
1 0 0 0 0 -1 0 0 0 0
0 1 0 0 0 0 -1 0 0 0
0 0 1 0 0 0 0 -1 0 0
-2 -1 -6 0 0 0 0 0 1 0
x1 x2 x3 s1 s2 s3 s4 s5 p
----------------------------------------------------------------------------
1 0 1 1 0 0 0 0 0 25
3 0 6 0 1 0 0 0 0 30
-1 0 0 0 0 1 0 0 0 0
0 1 0 0 0 0 -1 0 0 0
0 0 1 0 0 0 0 -1 0 0
-2 -1 -6 0 0 0 0 0 1 0
x1 x2 x3 s1 s2 s3 s4 s5 p
----------------------------------------------------------------------------
1 0 1 1 0 0 0 0 0 25
3 0 6 0 1 0 0 0 0 30
-1 0 0 0 0 1 0 0 0 0
0 -1 0 0 0 0 1 0 0 0
0 0 1 0 0 0 0 -1 0 0
-2 -1 -6 0 0 0 0 0 1 0
x1 x2 x3 s1 s2 s3 s4 s5 p
----------------------------------------------------------------------------
1 0 1 1 0 0 0 0 0 25
3 0 6 0 1 0 0 0 0 30
-1 0 0 0 0 1 0 0 0 0
0 -1 0 0 0 0 1 0 0 0
0 0 -1 0 0 0 0 1 0 0
-2 -1 -6 0 0 0 0 0 1 0
x1 x2 x3 s1 s2 s3 s4 s5 p
----------------------------------------------------------------------------
0.5 0 0 1 -0.17 0 0 0 0 20
0.5 0 1 0 0.17 0 0 0 0 5
-1 0 0 0 0 1 0 0 0 0
0 -1 0 0 0 0 1 0 0 0
0.5 0 0 0 0.17 0 0 1 0 5
1 -1 0 0 1 0 0 0 1 30
here we get Z = 30 and x1 = 0 , x2 = 0 and x3 = 5
