Linear Programming

Simplex Method
 There are 6 variables, but 3 equations.

So, initially we assume the value of

First convert the inequalities into decision variables is equal to zero.
equalities by adding slack variables

Now the objective function becomes

Next, construct the initial simplx table

Initial Simplex Table

Cj row 22 6 2 0 0 0
Co. Min.
B.V S.V x1 x2 x3 s1 s2 s3 Ratio
B.V
100/10
0 s1 100 10 2 1 1 0 0 =10

0 s2 72 7 3 2 0 1 0 72/7

0 s3 80 1 0 0 1 80/2=
2 4 40
Max Z = Zj row, 0 0 0 0 0 0
0*0+0*0
Cj row – Zj row 22 6 2 0 0 0
+0*0 = 0
Maximum +ve value in Cj row – Zj row is 22, so x1 is the entering variable and
x1 column is the key column.
In the minimum ratio column the +ve minimum value is 10,
so, s1 is the leaving variable.
Key/Intersection element is 10. so divide all the elements in that row by 10
to get new values
Now construct the second simplex table
 2nd Simplex Table

Cj row 22 6 2 0 0 0
Co. Min.
B.V S.V x1 x2 x3 s1 s2 s3 Ratio
B.V
22 x1 10/(1/5)
10 1 1/5 1/10 1/10 0 0

0 s2 2 0 8/5 13/10 -7/10 1 0 2/(8/5)

0 s3 60 0 18/5 4/5 -1/5 0 1 60/(18/5)

Max Z = Zj row, 22 22/5 11/5 11/5 0 0

22*10 =
Cj row – Zj row 0 8/5 -1/5 -11/5 0 0
220
Now, we have to find the new values for s2 & s3 rows using the following relation
New row=(Old row)-(its key column coefficient) x (corresponding element in replaced row )
Maximum +ve value in Cj row – Zj row is 8/5, so x2 is the entering variable and
x2 column is the key column. Key/Intersection element is 8/5
Construct the
In the minimum ratio column the +ve minimum value is 2/(8/5),
simplex table 3
so, s2 is the leaving variable.
3rd Simplex Table
Write x2 in place of s2 and divide all the elements in s2 row by 8/5

Cj row 22 6 2 0 0 0
Co. Min.
B.V S.V x1 x2 x3 s1 s2 s3 Ratio
B.V
22 x1 39/4 1 0 1/16 3/16 -1/8 0

6 x2 5/4 0 1 13/16 -7/16 5/8 0

111/2 0 0 -17/8 11/8 -9/4 1

0 s3

Max Z = Zj row, 22 6 25/4 3/2 9/4 0

222 Cj row – Zj row 0 0 -17/4 -3/2 -9/4 0

Now, we have to find the new values for x1 & s3 rows using the following relation
New row=(Old row)-(its key column coefficient) x (corresponding element in
replaced row )
There is no +ve value in the Cj – Zj Optimal solution is
row, So the solution is optimal. Max Z=222 and x1 = 39/4, x2 = 5/4 and x3 = 0