Scribd
Upload
84 views

Simplex Method (Special Cases) - Mail

The document discusses solving linear programming problems (LPPs) using the simplex method and describes some special cases that may occur. It provides examples of an unbounded LPP, multiple optimal solutions, and degeneracy. For an LPP involving maximizing Z=-2x1+3x2 with constraints, the simplex method reveals there is no outgoing variable, indicating an unbounded solution. Another example shows an LPP with multiple optimal solutions at different corners of the feasible region. A third example demonstrates a degenerate case where there is a tie in the ratio, signaling alternative optimal solutions.

Uploaded by

Ishita Rai
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
84 views

Simplex Method (Special Cases) - Mail

The document discusses solving linear programming problems (LPPs) using the simplex method and describes some special cases that may occur. It provides examples of an unbounded LPP, multiple optimal solutions, and degeneracy. For an LPP involving maximizing Z=-2x1+3x2 with constraints, the simplex method reveals there is no outgoing variable, indicating an unbounded solution. Another example shows an LPP with multiple optimal solutions at different corners of the feasible region. A third example demonstrates a degenerate case where there is a tie in the ratio, signaling alternative optimal solutions.

Uploaded by

Ishita Rai
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Simplex Method (Special Cases)

Solve the following LPP by Simplex Method

Maximize Z= -2x1+3x2
Subject to
x1≤5
2x1-3x2≤6
X1, X2≥0
Standard Form

Maximize Z= -2x1+3x2+0S1+0s2
Subject to
X1+S1=5
2x1-3x2+S2=6
X1, X2, S1, S2≥0
Cj -2 3 0 0
CB B b x1 x2 s1 s2 Min Ratio
0
s1 5 1 0 1 0 -
0
s2 6 2 -3 0 1 -
Zj 0 0 0 0
Cj-Zj -2 3 0 0

No outgoing variable - Unbounded


Multiple Optimum Solution (Alternate Solution)

Sometimes an LPP has more than one optimum solution.


Such solutions are called the alternate optimal solutions of
the given LPP. The presence of a zero in Cj-Zj row below the
non-basic variables in the optimum simplex table is an
indication of the existence of an alternative solution . This
means that in case of an alternate optimum solution , the
optimal solution occurs at more than one corner.
Solve by Simplex Method

Maximize Z= 4 x1+ 6 x2
Subject to

2 x1+ 3x2 ≤6
x1- x2 ≤1

x1, x2 ≥0
Solve by Simplex Method

Maximize Z= 4 x1+ 6 x2 + 0S1 + 0S2


Subject to

2 x1+ 3x2 + 0S1=6


x1- x2+ 0S2 =1

x1, x2 ,S1 ,S2 ≥0


Cj 4 6 0 0
CB B b x1 x2 s1 s2 Min Ratio
0 6 2 3 1 0 2
s1
0 1 1 -1 0 1 -
s2
Zj 0 0 0 0
Cj-Zj 4 6 0 0
Cj 4 6 0 0
CB B b x1 x2 s1 s2 Min Ratio

0 s1 6 2 3 1 0 2
0 s2 1 1 -1 0 1 -
Zj 0 0 0 0
Cj-Zj 4 6 0 0
6 x2 2 2/3 1 1/3 0 3
0 s2 3 5/3 0 1/3 1 1.8
Cj-Zj 0 0 -2 0
Cj 4 6 0 0
CB B b x1 x2 s1 s2 Min Ratio
6 2 2/3 1 1/3 0 3
x2
0 3 5/3 0 1/3 1 1.8
s2
Cj-Zj 0 0 -2 0
6 4/5 0 1 1/5 -2/5
x2
4 9/5 1 0 1/5 3/5
x1
Cj-Zj 0 0 -2 0
It is case of multiple optimum solution.

X1=0, X2=2, Z= 12

X1=9/5, x2=4/5, Z= 12
Solve the following LPP by Simplex Method

Maximize Z= 3x1+9x2
Subject to
x1+ 4x2 ≤8
x1+2 x2 ≤4

x1, x2 ≥0
Cj 4 6 0 0
CB B b x1 x2 s1 s2 Min Ratio

0 s1 8 1 4 1 0 2
0 s2 4 1 2 0 1 2
Zj 0 0 0 0
Cj-Zj 3 9 0 0

There is tie in the ratio. This is an indication for the existence of degeneracy.
Cj 4 6 0 0
CB B b x1 x2 s1 s2 Min Ratio

0 s1 0 -1 0 1 -2
9 x2 2 1/2 1 0 1/2
Zj 9/2 9 0 9/2
Cj-Zj -3/2 0 0 -9/2

All cj-zj≤0 X1=0, X2=2, Z= 18

You might also like