Linear Programming Consider the following set of equations S
Linear Programming. Consider the following set of equations. Solve it using the Simplex method.
subject to
Solution
Minimize : x1 - 2x2
Inequalties : -4x1 +6x2 <=9
x1 + x2 <=4
x1 , x2 >=0
Tableau #1
x1 x2 s1 s2 s3 s4 -p
-4 6 1 0 0 0 0 9
1 1 0 1 0 0 0 4
1 0 0 0 -1 0 0 0
0 1 0 0 0 -1 0 0
1 -2 0 0 0 0 1 0
Tableau #2
x1 x2 s1 s2 s3 s4 -p
-4 6 1 0 0 0 0 9
1 1 0 1 0 0 0 4
-1 0 0 0 1 0 0 0
0 1 0 0 0 -1 0 0
1 -2 0 0 0 0 1 0
Tableau #3
x1 x2 s1 s2 s3 s4 -p
-4 6 1 0 0 0 0 9
1 1 0 1 0 0 0 4
-1 0 0 0 1 0 0 0
0 -1 0 0 0 1 0 0
1 -2 0 0 0 0 1 0
Tableau #4
x1 x2 s1 s2 s3 s4 -p
-0.666667 1 0.166667 0 0 0 0 1.5
1.66667 0 -0.166667 1 0 0 0 2.5
-1 0 0 0 1 0 0 0
-0.666667 0 0.166667 0 0 1 0 1.5
-0.333333 0 0.333333 0 0 0 1 3
Tableau #5
x1 x2 s1 s2 s3 s4 -p
0 1 0.1 0.4 0 0 0 2.5
1 0 -0.1 0.6 0 0 0 1.5
0 0 -0.1 0.6 1 0 0 1.5
0 0 0.1 0.4 0 1 0 2.5
0 0 0.3 0.2 0 0 1 3.5
Optimal Solution: p = -3.5; x1 = 1.5, x2 = 2.5
Minium value = -3.5
