Degeneracy
Degeneracy refers to the concept of getting a degenerate basic feasible solution in a LPP. The degeneracy in a LPP may occur
At the starting stage, when at least one basic variable is zero in the initial basic feasible solution.
At any following iteration when more than one basic variable is suitable to leave the basic and therefore one or more variables becoming zero in the subsequent iteration and the problem is said to be degenerate. There is no guarantee that the value of the objective function will get better, as the new solutions may stay degenerate. Consequently, it is possible to repeat the identical sequence of simplex iterations continuously without improving the solutions. This concept is called as cycling or circling.
Rules to avoid cycling
Divide every element in the tied rows with the positive coefficients of the key column in that particular row.
Compare the resultant ratios, column by column, first of all in the identity and then in the body, from left to right.
The row which firstly consists of the smallest algebraic ratio now contains the leaving variable.
Example 1
Max Z = 3x_{1} + 9x_{2}
Subject to
x_{1} + 4x_{2 }≤ 8
x_{1 }+ 2x_{2} ≤ 4
& x_{1 }≥ 0, x_{2 }≥ 0
Answer
Standard LPP
Max Z = 3x_{1} + 9x_{2 }+ 0s_{1 }+ 0s_{2}
x_{1} + 4x_{2 }+ s_{1 }= 8
x_{1 }+ 2x_{2 }+ s_{2} = 4
x_{1 }, x_{2 }, s_{1}, s_{2 }≥ 0
C_{j}→
3
9
0
Basic Variables
C_{B}
X_{B}
X_{1}
X_{2}
S_{1}
S_{2}
X_{B} / X_{K}
S_{1} / X_{2}
s_{1}
8
1
4
1/4
s_{2}
2
0/2→
Z = 0
3
↑
9
←Δ_{j}
1
x_{2}
1/2
Z =18
3/2
9/2
As all Δ_{j }≥ 0, optimal basic feasible solution is achieved. Thus the solution is Max Z = 18, x_{1 }= 0, x_{2} = 2
Note  As there is a tie in minimum ratio (degeneracy), we determine minimum of s_{1} /x_{k} for these rows for which the tie exists.
Example 2
Max Z = 2x_{1} + x_{2}
4x_{1} + 3x_{2 }≤ 12
4x_{1} + x_{2 }≤ 8
4x_{1}  x_{2 }≤ 8
Max Z = 2x_{1} + x_{2 }+ 0s_{1 }+ 0s_{2 }+ 0s_{3}
4x_{1} + 3x_{2 }+ s_{1 }= 12
4x_{1} + x_{2 }+ s_{2} = 8
4x_{1}  x_{2 }+ s_{3} = 8
x_{1 }, x_{2 }, s_{1}, s_{2}, s_{3 }≥ 0
Basic Varibles
S_{3}
S_{1} / X_{1}
S_{2} / X_{1}
12
12/4=3
8/4=2
4/0=0
s_{3}
0/4=0→
2
4/4=1
0→
x_{1}
1/4

Z = 4
3/2
1/2
1/8
16
3/4
0 4
1 2
2 3/2
1/8
3/8
Z = 5
As all Δ_{j }≥ 0, optimal basic feasible solution is achieved. Hence the solution is Max Z = 5, x_{1 }= 3/2, x_{2} = 2
18,76,764
Questions Asked
21,311
Experts
9,67,568
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!