Professional Documents
Culture Documents
Chapter 04 - The Simplex Method Tableau Form
Chapter 04 - The Simplex Method Tableau Form
Cj
5 2 3 -1 1
Constants
x1 x2 x3 x4 x5
CB Basis
x4
-1 1 2 2 1 0 8
x5
1 3 4 1 0 1 7
2
The Simplex Method
Tableau Form
Where,
Basis: Basic variables in the current bfs.
Constants: Values of the basic variables.
C j : Coefficients of the variables in the objective function.
5 2 3 -1 1
Cj
Constants
x1 x2 x3 x4 x5
CB
Basis
-1 x4
1 2 2 1 0 8
1 x5 3 4 1 0 1 7
3 0 4 0 0 Z=-1
C
row
4
The Simplex Method
Tableau Form
Since there are positive values in C row, the current solution is not optimal.
x 3 is the entering variable, because it has the highest relative profit. x min{ 4,7} 4
3
5
The Simplex Method
Tableau Form
Thus, 4
Z (3,1). 12 3 15
3
And the relative profits are:
1/ 2
C1 5 (3,1). 5 4 1
5 / 2
1
C 2 2 (3,1). 2 6 4
3
1/ 2
C 4 1 (3,1). 1 1 2
1 / 2
Iteration # 3
x
So, x1 is the new entering variable, x1 min{ 8,6 / 5} 6 / 5 , and 5 is the leaving variable.
x1 6 / 5, x3 17 / 5, x 2 x 4 x5 0.
Now, rewrite the system in canonical form wrt to the new basic variables.
6
The Simplex Method
Tableau Form
Cj
5 2 3 -1 1
CB
Constants
x1 x2 x3 x4 x5
Basis
7
The Simplex Method
Tableau Form
8
Summary
9
Example
Max. Z 3x1 2 x2
S .T : x1 2 x2 x3 4
3x1 2 x2 x4 14
x1 x2 x5 3
x1 ,...,x5 0
10
Important Remark
When the relative profits of all the nonbasic variables are all negative, the optimal solution is
unique. And if one relative profit or more of the nonbasic variables is zero, the optimal
solution is not unique. For example, if we carry the above example one more step, we get:
x5 min{15 / 4,5 / 3,10} 15 / 4
x 5 is the new entering variable, and x 3 is the leaving variable. And the tableau becomes:
Cj 3 2 0 0 0 constants
CB
basis x1 x2 x3 x4 x5
11
Important Remark
5/8
C 3 0 (0,2,3). 3 / 8 0 0 3 / 4 3 / 4 0
1/ 4
1/ 8
C 4 0 (0,2,3). 1 / 8 0 0 1 / 4 3 / 4 1
1/ 4
Thus, x 3 is the entering variable, and x3 min{ 6, , } 6, and x 5 is the leaving variable.
So, we get the previous iteration. Which means that we have two optimal solutions, both give
Z=14.
12
Minimization LPP
A. First Approach
1. A negative coefficient in the relative profits row indicates that the corresponding nonbasic
variable when increased will reduce the value of the objective function. Hence, in
minimization problems, only those nonbasic variables with negative relative profits are
eligible to enter the basis and improve the objective function.
2. The optimal solution is obtained when all coef’s in the rel. profits row are nonnegative.
Thus, all previous steps in maximization LPP are the same, except the following modified
step: If all the coef.’s in the rel. profits row are positive or zero, then the current basic
feasible solution is optimal. Otherwise, select the nonbasic variable with the lowest (most
negative) value in the rel. profits row to enter the basis.
B. Second Approach
Example: minimize Z 40 x1 36 x2 becomes maximize Z 40 x1 36 x2 , and then set the
required minimum value to be the negative of the solution you obtain.
13