In this presentation we

illustrate the ideas

developed in the
previous presentation
with two more problems
Consider the following LPP:
Maximize z  6 x1  x2  2 x3
Subject to 1
2 x1  2 x2  x3  2
2
3
4 x1  2 x2  x3  3
2
1
x1  2 x2  x3  1
2
x1 , x2 , x3  0
Let x4, x5, x6 denote the slack variables for the
respective constraints. So the starting simplex
tableau is
Basic z x1 x2 x3 x4 x5 x6 Sol

z 1 -6 -1 -2 0 0 0 0
x4 0 2 2 1/2 1 0 0 2
x5 0 -4 -2 -3/2 0 1 0 3
x6 0 1 2 1/2 0 0 1 1
After we apply the Simplex method a portion
of the final tableau is as follows:

Basic z x1 x2 x3 x4 x5 x6 Sol

z 1 2 0 2
x5 0 1 1 2
x3 0 -2 0 4
x1 0 1 0 -1

Identify the missing numbers.

We first observe that as x1 is the 3rd 0
basic variable, the x1 column in the 0
final tableau (including the objective  
function row) will be
0
 
1 
Similarly as x3 is the 2nd basic 0
variable, the x3 column in the final 0
tableau (including the objective  
function row) will be 1 
 
0
 0 1/ 2 2

Basic Matrix is B  1 3 / 2 4 

0 1/ 2 1 

 1 1 2
Its inverse is 1 
B   2 0 4
 1 0 1 
found below x4, x5, x6 in the final tableau.
Hence the new x2 column (in the constraint
equations) in the final tableau is
 1 1 2  2 4

B A2   2 0
1
4  2    4 
   
 1 0 1   2   0 
Hence the new RHS column (in the
constraint equations) in the final tableau is
 1 1 2 2 7 
1
B b  2 0 4 3  0
    
 1 0 1  1   1 
The entry below x2 in the z-row in the final
tableau is
z2  c2  cB B A2  c2
1

4
 
  0 2 6  4   c2  8  1  7
 0 
The new z-value in the final tableau is
7 
 
cB B b   0 2 6 0   6
1

1 
Thus the final tableau with all the missing
entries filled is:
Basic z x1 x2 x3 x4 x5 x6 Sol

z 1 0 7 0 2 0 2 6
x5 0 0 4 0 1 1 2 7
x3 0 0 4 1 -2 0 4 0
x1 0 1 0 0 1 0 -1 1
Consider the following LPP:
Maximize z  2 x1  4 x2  3x3
Subject to
x1  3 x2  2 x3  20
x1  5 x2  10
x1 , x2 , x3  0

We shall apply the big M method. Thus the

modified problem is:
Modified LPP:
Maximize z  2 x1  4 x2  3x3  M R1  M R2
Subject to
x1  3x2  2 x3  R1  20
x1  5 x2  s2  R2  10
x1 , x2 , x3 , s2 , R1 , R2  0

s2 is a surplus variable. R1, R2 are artificial

variables.
Taking x1, s2 as basic variables, find the Simplex
tableau and verify it is the optimal tableau.
Thus we shall fill the entries in the tableau below
Basic z x1 x2 x3 R1 s2 R2 Sol

z 1
x1 0
s2 0
Since x1, s2 are the basic variables in that
order, the basic matrix is
1 0 
B 
1 1

1 1 0 
And its inverse is B  1 1
 
Hence the new constraint columns are:

1 1 0  1 1 
B A1 
1 1 1  0  ,
    
1
B A2  1 0   3  3
1 1 5   2  ,
     
1
B A3  1 0   2 2
1 1 0  2 ,
     
 1 1 0  1  1
B A4 
1 1 0  1 ,
    
1
B A5  1 0   0 0 
1 1  1  1  ,
     
1 1 0  0  0
B A6 
1 1 1     1
     
 The (new) RHS = Solution column is

1 1 0   20   20 
B b   10   10 
1 1    
The entries below x1, x2, x3, x4, x5, x6 in the
objective function row in the final tableau
will be
1 
z1  c1  cB B A1  c1   2 0    2  0
1

0 
  3
z2  c2  cB B A2  c2   2 0    4  2
1

 2
 2
z3  c3  cB B A3  c3 
1
 2 0  2   3  1
 
1 
z4  c4  cB B A4  c4   2 0   ( M )
1
1

 M 2
0 
z5  c5  cB B A5  c5 
1
 2 0 1   0  0
 
  0
z6  c6  cB B A6  c6   2 0    ( M )
1

 1
M

Finally the new z-value is

 20
cB B b   2 0    40
1

10 
 Thus the final tableau is shown below:

Basic z x1 x2 x3 R1 s2 R2 Sol

z 1 0 2 1 M+2 0 M 40
x1 0 1 3 2 1 0 0 20
s2 0 0 -2 2 1 1 -1 10

This is clearly the optimal tableau.