Simplex Method

① Solve the following LPP using simplex method.

Max z = x1 + 2x2 * Check
Sub.to Obj. function = max. & Constraints are ≤

- x1 + 2x2 ≤ 8
x1 + 2x2 ≤ 12
x1 - 2x2 ≤ 3
x1, x2 ≥ 0
• Intro. of slack variables.
Introduce slack variable x3, x4 & x5. Purpose = convert into a perfect eqn.
Auxiliary LPP • Co - efficient of slack variable in the const. is + one
& obj. function is zero.
Max z = x1 + 2x2 + 0x3 + 0x4 + 0x5
Sub to
-x1 + 2x2 + x3 = 8
x1 + 2x2 + x 4 = 12
x1 – 2x2 + x5 = 3
x1, x2, x3, x4 & x5 ≥ 0

I.B.F.S ( Initial Basic Feasible Solution),

( x3, x4, x5) = ( 8, 12, 3).
Starting Table, • Check for optimality
Pivot Column
Pivot Element

1 2 0 0 0

CB YB XB Y1 Y2 Y3 Y4 Y5 XB/Y2 Pivot Row

0 Y3 8 -1 2 * 1 0 0
1 2 1 4
0 Y4 12 0 0
6
0 Y5 3 1 -2 0 0 1 -ve

Z j - Cj 0 -1 -2 0 0 0
(Net Evaluation) Entering Vector – y2
Leaving Vector – y3
I Iteration Pivot Column
Pivot Element Pivotal
Pivot Row Calculation
XB 12 12 – (2 x 8/2)= 4
1 2 0 0 0 Column

CB Y1 Y2 Y3 Y4 Y5 3 3 - (-2 x 8/2) = 11
YB XB XB/Y1
y1
Column 1 1 – (2 x -1/2)= 2
2 y2 4 -1/2 1 1/2 0 0 -ve
1 1 - (-2 x -1/2) = 0
0 y4 4 2* 0 -1 1 0 2
y3
0 y5 11 0 0 1 0 1 Column 0 0 – (2 x 1/2)= -1
∞

Z j - Cj 8 -2 0 1 0 0 0 0 - (-2 x 1/2) = 1
(Net Evaluation) Entering Vector – y1
Leaving Vector – y4
II Iteration,

1 2 0 0 0

CB YB XB Y1 Y2 Y3 Y4 Y5

2 y2 5 0 1 1/4 1/4 0
1 y1 2 1 0 -1/2 1/2 0
0 y5 11 0 1 0 1
0

Z j - Cj 12 0 0 0 1 0
(Net Evaluation)
All the Zj – Cj values are ≥ 0. It is an optimal table
X1 = 2
X2 = 5
Zmax = 12
2) Max z = 3x1 + 2x2
Sub.to
x1 + x 2 ≤ 4
x1 - x2 ≤ 2
x1, x2 ≥ 0
Introduce slack variable x3 & x4
Auxiliary LPP
Max. z = 3x1 + 2x2 + 0x3 + 0x4
Sub to
x1 + x2 + x 3 = 4
x1 – x2 + x4 = 2
x1, x2, x3 & x4 ≥ 0

I.B.F.S ( Initial Basic Feasible Solution),

( x3, x4) = ( 4, 2 )
Starting Table, Pivot Column

Pivot Element

3 2 0 0

CB YB XB Y1 Y2 Y3 Y4 Pivot Row Y1 enters basis

Y4 leaves basis
0 Y3 4 1 1 1 0
4/1 Pivot Element = 1
0 Y4 2 1* -1 0 1
2/1

Z j - Cj 0 -3 -2 0 0
(Net Evaluation)
I Iteration, Pivot Column Pivot Row
Pivot Element Pivotal
Calculation

0 0 4 4 - (2 x 1)= 2
3 2
1
CB Y1 Y2 Y3 Y4 1 1 - (1 x -1) = 2
YB XB
1
0 0 – (1 x 1)= -1
0 y3 2 0 2* 1 -1 1
2/2
3 y1 2 1 -1 0 1 Y2 enters basis
-ve
Y3 leaves basis

Z j - Cj 6 0 -5 0 3 Pivot Element = 2

(Net Evaluation) Entering Vector – y2

Leaving Vector – y3
II Iteration,

3 2 0 0 2 2 - (-1 x 2) = 3
2
CB YB XB Y1 Y2 Y3 Y4 1 1 - (-1 x 0) = 1
2
y2 0 0 - (-1 x 1 ) = 1/2
2 1 0 1 1/2 -1/2
2
3 y1 3 1 0 1/2 1/2 1 1 - (-1 x -1) = +1/2
2
11 0 0 5/2 1/2

Optimal solution,
Max. Z = 11
x1 = 3
x2 = 1