Correction Tutorial 4 LP Ex 1 2 4 5
Correction Tutorial 4 LP Ex 1 2 4 5
MAXIMIZE: Z = 3 X1 -1 X2 MAXIMIZE: Z = 3 X1 -1 X2
1 X1 + 1 X2 ≤ 10 1 X1 + 1 X2 +s1 = 10
1 X1 -1 X2 ≤ 2 1 X1 -1 X2 + s2= 2
X1, X2 ≥ 0 X1, X2, s1, s2 ≥ 0
Point X coordinate (X1) Y coordinate (X2) Value of the objective function (Z)
O 0 0 0
A 0 10 -10
C 6 4 14
D 2 0 6
Tableau 1
Cb Basic X1 X2 S1 S2 value Ratio
0 S1 1 1 1 0 10 10
0 S2 1 -1 0 1 2 2
C- row 3 -1 0 0 Z=0
3 X1 1 0 0,50 0,50 6
C- row 0 0 -1 -2 Z=14
Ex 2
MAXIMIZE: Z = 5 X1 + 2 X2 + 1 X3
subject to
1 X1 + 3 X2 -1 X3 + 1 X4 = 6
0 X1 + 1 X2 + 1 X3 + 1 X5 = 4
3 X1 + 1 X2 + 1 X6 = 7
Tableau 1
Cb Basic X1 X2 X3 X4 X5 X6 Value Ratio
0 X4 1 3 -1 1 0 0 6 6
0 X5 0 1 1 0 1 0 4 -
0 X6 3 1 0 0 0 1 7 7/3
C-row 5 2 1 0 0 0 Z=0
Tableau 2
Cb Basic X1 X2 X3 X4 X5 X6 Value Ratio
0 X4 0 8/3 -1 1 0 -1 / 3 11 / 3 -
0 X5 0 1 1 0 1 0 4 4
5 X1 1 1/3 0 0 0 1/3 7/3 -
C-row 0 1/3 1 0 0 5/3 Z= 35 / 3
The leaving variable is X5 and entering variable is X3.
Tableau 3
Cb Basic X1 X2 X3 X4 X5 X6 Value Ratio
0 X4 0 11 / 3 0 1 1 -1 / 3 23 / 3
1 X3 0 1 1 0 1 0 4
5 X1 1 1/3 0 0 0 1/3 7/3
C-row 0 -2 / 3 0 0 -1 -5 / 3 Z= 47 / 3
MAXIMIZE: MAXIMIZE: Z = 5 X1 + 2 X2 -1 X3
Z = 5 X1 + 2 X2 -1 X3
subject to subject to
-2 X1 + 1 X2 -1 X3 ≤ 1 -2 X1 + 1 X2 -1 X3 + 1 X4 = 1
1 X1 + 1 X2 + 0 X3 ≤ 3 1 X1 + 1 X2 + 1 X5 = 3
X1 , X 2 , X3 ≥ 0
N: number or variables= 5
1- =( )
P= number of constraints= 2
=( )
= 10
Tableau 1
Cb Basic X1 X2 X3 S1 S2 Value Ratio
0 S1 -2 1 -1 1 0 1 -
0 S2 1 1 0 0 1 3 3
C row 5 2 -1 0 0 Z=0
C row 0 -3 -1 0 -5 Z=15
The optimal solution value is Z = 15
X1 = 3
X2 = 0
X3 = 0
For constraint 1: s1 =7 (in the optimal tableau) => it’s a non-binding constraint and it’s not useful
for increasing optimality
Ex 5:
MINIMIZE: Z = 5 X1 + 7 X2
0 X1 + 1 X2 ≥ 6
0 X1 + 1 X2 ≤ 15
3 X1 + 2 X2 = 42
X1, X 2 ≥ 0
We have a feasible segment: BD
Point X coordinate (X1) Y coordinate (X2) Value of the objective function (Z)
B 10 6 92
D 4 15 125