Use Simplex Method to maximize P 2x1 3x2 3x3 subject to x
Solution
written as in table form:
x1 x2 x3 s1 s2 s3 s4 s5 p
------------------------------------------------------------------------
1 -1 -2 1 0 0 0 0 0 3
1 1 0 0 1 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 0 1 0 0 0 0 -1 0 0
-2 -3 3 0 0 0 0 0 1 0
x1 x2 x3 s1 s2 s3 s4 s5 p
------------------------------------------------------------------------
1 -1 -2 1 0 0 0 0 0 3
1 1 0 0 1 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 0 1 0 0 0 0 -1 0 0
-2 -3 3 0 0 0 0 0 1 0
x1 x2 x3 s1 s2 s3 s4 s5 p
------------------------------------------------------------------------
1 -1 -2 1 0 0 0 0 0 3
1 1 0 0 1 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 0 1 0 0 0 0 -1 0 0
-2 -3 3 0 0 0 0 0 1 0
x1 x2 x3 s1 s2 s3 s4 s5 p
------------------------------------------------------------------------
1 -1 -2 1 0 0 0 0 0 3
1 1 0 0 1 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 0 -1 0 0 0 0 1 0 0
-2 -3 3 0 0 0 0 0 1 0
x1 x2 x3 s1 s2 s3 s4 s5 p
------------------------------------------------------------------------
2 0 -2 1 1 0 0 0 0 8
1 1 0 0 1 0 0 0 0 5
-1 0 0 0 0 1 0 0 0 0
1 0 0 0 1 0 1 0 0 5
0 0 -1 0 0 0 0 1 0 0
1 0 3 0 3 0 0 0 1 15
then solution: p = 15; x1 = 0, x2 = 5, x3 = 0
