Professional Documents
Culture Documents
http://studygalaxy.com/
1
There are four special cases arise in the use of the simplex method.
1. 2. 3. 4.
Degeneracy ( no improve in objective) It typically occurs in a simplex iteration when in the minimum ratio test more than one basic variable determine 0, hence two or more variables go to 0, whereas only one of them will be leaving the basis. Model has at least one Redundant Constraint. This is in itself not a problem, but making simplex iterations from a degenerate solution may give rise to cycling, meaning that after a certain number of iterations without improvement in objective value the method may turn back to the point where it started.
3
ST
x1 + 4x2 8 X1 + 2x2 4 X1, x2 0
Iteration 0
Entering Variable Basis s1 s2 Z X1 1 1 -3 X2 4 2 -9 S1 1 0 0 S2 0 1 0 Leaving Variable RHS 8 4 0
Here X1 and X2 tie for leaving variable( with same minimum ratio 2)
Iteration 1
Entering Variable Leaving Variable Basis X2 s2 Z X1 1/4 -3/4 X2 1 0 0 S1 1/4 -1/2 2/4 S2 0 1 0 RHS 2 0 18
Iteration 2
Basis X2 X1 Z X1 0 1 0 X2 1 0 0 S1 -1 3/2 S2 -1/2 2 3/2 RHS 2 0 18 Same objective
Same objective no change and improve ( cycle) Is it possible to stop computation at Iteration1?
8
11
12
Temporarily Degenerate
Such that
4X1+3X2+S2 =12
4X1+X2+S3=8 X1,X2 ,S1,S2,S30
15
16
17
18
19
Alternative optima
If the z-row value for one or more nonbasic variables is 0 in the optimal tubule, alternate optimal solution exists. When the objective function is parallel to a binding constraint objective function will assume same optimal value. We have infinite number of such points
20
Example:
Max 2x1+ 4x2
ST
x1 + 2x2 5
x1 + x 2 4
x1, x2 0
21
The solution
Max 2x1+ 4x2
ST
x1 + 2x2 + s1= 5
x1 + x 2 + s2 = 4
x1, x2, s1, s2 0
22
Iteration0
Entering Variable Leaving Variable Basis s1 s2 Z X1 1 1 -2 X2 2 1 -4 S1 1 0 0 S2 0 1 0 RHS 4 5 0
23
Basis x2 s2 Z
X1 1/2 1/2 0
X2 1 0 0
S1 1/2 -1/2 2
S2 0 1 0
The coefficient for x1 is 0, which indicates that x1 can enter the basic solution without changing the value of z.
25
27
28
29
30
In practice alternate optima are useful as they allow us to choose from many solutions experiencing deterioration in the objective value.
31
3.Unbounded solution:
It occurs when nonbasic variables are zero or negative in all constraints coefficient (max) and variable coefficient in objective is negative
32
Example
Max 2x1+ x2 ST x1 x2 10 2x1 40 x1, x20
Solution
Max 2x1+ x2 ST x1 x2 +s1 =10
2x1+s2 =40
x1, x2,s1,s2 0
We can conclude that after 3rd iteration if we increase the value of x2 ,value of z will increase correspondingly up to infinite. Hence we can conclude that solution is unbounded.
Example:
Maximize Z=20 x1+10 x2 S.T. 3x1-3x2+5x3 50 x1+x3 10 x1-x2+4x3 20 x1,x2,x3 0
Solution:
Maximize Z=20x1+10x2 3x1-3x2+5x3+s1 = 50
x1+x3+s2 = 10
x1-x2+4x3+s3 = 20 x1,x2,x3,s1,s2,s3 0
Basis x1 S1 3
x2 -3
x3 5
s1 1
s2 0
s3 0
RHS 50
S2
S3 Z
1
1 -20
0
-1 -10
1
4 -1
0
0 0
1
0 0
0
1 0
10
20 0
Infeasible Solution:
This situation can never occur if all the constraints are of the type with nonnegative RHS because slack provide feasible solution. High penalty is provided with R in objective function to reduce them to 0 at optimum. Artificial variable R coefficient at end 0 if solution is infeasible.
Example:
Maximize Z=3x1+2x2 S.T.
2x1+x2 2
3x1+4x2 12 x1,x2=0
Solution (Graphical):
2x1+x2+S1 = 2
3x1+4x2-S2+R = 12 x1,x2,S1,S2,R 0
R0 Pseudo optimum
SOLUTION INFEASIBLE
REFERENCES
THANK YOU