Degeneracy

if 𝑥1 , 𝑥2 , 𝑥3 are non -basic variables then 𝑥1 = 𝑥2 = 𝑥3 = 0. If 𝑠1, 𝑠2 are basic

variables then 𝑠1 ≠ 0, 𝑠2 ≠ 0. If 𝑠1𝑜𝑟 𝑠2 is equal to zero. So it is the case of
degeneracy. In this case 0 is taken as minimum positive ratio for one time.

OR

Suppose n = No. of variables (decision + slack) and m = no. of constraints

If more than n – m variables are zero, it is the case of degeneracy.

Example

Maximize (F) =4𝑥1 + 𝑥2 + 2𝑥3 subject to constraints

𝑥1 + 𝑥2 + 𝑥3 ≤ 1, 𝑥1 + 𝑥2 − 𝑥3 ≤ 0, 𝑥1 ≤ 0, 𝑥2 ≤ 0, 𝑥3 ≤ 0

Solution: Let 𝑠1, 𝑠2 are slack variables. The normal form or standard form of given
LPP is given by

𝐹 − 4𝑥1 − 𝑥2 − 2𝑥3 + 0𝑠1 + 0𝑠2 = 0

𝑥1 + 𝑥2 + 𝑥3 + 𝑠1 = 1

𝑥1 + 𝑥2 − 𝑥3 + 𝑠2 = 0

IBFS table

𝐹 𝑥1 𝑥2 𝑥3 𝑠1 𝑠2 b Min.+ve
ratio
1 -4 -1 -2 0 0 0 0
=0
−4
0 1 1 1 1 0 1 1
=1
1
0 1 1 -1 0 1 0 0
=0
1
Here, 𝑥1 , 𝑥2 , 𝑥3 are non basic variable and If 𝑠1, 𝑠2 are basic variable. In first row
the greatest negative element is -4. So 𝑥1 is pivot column. Here , 𝑠2 is basic
variable but 𝑠2 = 0, so it is the case of degeneracy and 0 is taken as minimum
positive ratio for one time. Therefore 𝑅3 is pivot row and 1 is pivot element.

Apply 𝑅1: 𝑅1 + 4𝑅3 , 𝑅2: 𝑅2 − 𝑅3

𝐹 𝑥1 𝑥2 𝑥3 𝑠1 𝑠2 b Min.+ve
ratio
1 0 3 -6 0 4 0 0
=0
−6
0 0 0 2 1 -1 1 1
= .5
2
0 1 1 -1 0 1 0 0
=0
−1
𝑥3 is pivot column, 𝑅2 is pivot row and 2 is pivot element.

Apply 𝑅1: 𝑅1 + 3𝑅2 , 𝑅3 : 2𝑅3 + 𝑅2

𝐹 𝑥1 𝑥2 𝑥3 𝑠1 𝑠2 b Min.+ve
ratio
1 0 3 0 3 1 3
0 0 0 2 1 -1 1
0 2 2 0 1 1 1
Since, there is no negative element in first row. So it has optimal solution.

On equating, we get

𝐹=3
1
2𝑥1 = 1 → 𝑥1 =
2
Since 𝑥2 is non basic variable, so 𝑥2 = 0
1
2𝑥3 = 1 → 𝑥3 =
2
1 1
Hence maximum value = 3 at the point ( , 0, )
2 2

Big M Method (Artificial variable Method)

Example: Using an artificial variable method or Big M method,

Maximize(𝑧) = 2𝑥1 − 𝑥2 subject to constraints

𝑥1 + 𝑥2 ≥ 5, −𝑥1 + 𝑥2 ≤ 1, 5𝑥1 + 4𝑥2 ≤ 40, 𝑥1 , 𝑥2 ≥ 0

Solution: Let us introduce slack variables 𝑠2, , 𝑠3 and surplus variable 𝑠1, artificial
variable 𝐴1. The normal form of given LPP is

𝑧 − 2𝑥1 + 𝑥2 + 𝑀𝐴1 + 0𝑠1 + 0𝑠2 + 0𝑠3 = 0

𝑥1 + 𝑥2 − 𝑠1 + 𝐴1 = 5

−𝑥1 + 𝑥2+ 𝑠2, = 1

, 5𝑥1 + 4𝑥2 + 𝑠3 = 40

Where M is very large positive number

Note: For max. type, it is subtracted from objective function ie -M𝐴1

For min. type, it is added to objective function ie + M𝐴1

IBFS table

𝑧 𝑥1 𝑥2 𝑠1 𝑠2 𝑠3 𝐴1 𝑏 Min.+ve
ratio
1 -2 1 0 0 0 M 0
0 1 1 -1 0 0 1 5
0 -1 1 0 1 0 0 1
0 5 4 0 0 1 0 40

Firstly, we change column 𝐴1 in to basic variable.

Apply 𝑅1 → 𝑅1 − 𝑀𝑅2
 𝑧 𝑥1 𝑥2 𝑠1 𝑠2 𝑠3 𝐴1 𝑏 Min.+ve
ratio
1 -2- M 1- M M 0 0 0 -5M −5𝑀
=infinity
−2−𝑀
0 1 1 -1 0 0 5 1 5
= 5(min )
1
0 -1 1 0 1 0 0 1 1
= −1
−1
0 5 4 0 0 1 0 40 40
=8
5
In first row the greatest –ve element is -2-M. So 𝑥1 is pivot column. Minimum
positive ratio is 5.𝑅2 is pivot row and 1 is pivot element.

Apply: 𝑅1 → 𝑅1 + (2 + 𝑀)𝑅2

𝑅3 → 𝑅3 + 𝑅2

𝑅4 → 𝑅4 − 5𝑅2

𝑧 𝑥1 𝑥2 𝑠1 𝑠2 𝑠3 𝐴1 𝑏 Min.+ve
ratio
1 0 3 -2 0 0 2+M 10 10
= −5
−2
0 1 1 -1 0 0 1 5 5
= −5
−1
0 0 2 -1 1 0 1 6 6
= −6
−1
0 0 -1 5 0 1 -5 15 15
5
= 3(𝑚𝑖𝑛. )
𝑠1is pivot column, 𝑅4 is pivot row and 5 is pivot element.

Apply: 𝑅1 → 5𝑅1 + 2𝑅4, 𝑅2 → 5𝑅2 + 𝑅4 , 𝑅3 → 5𝑅3 + 𝑅4

𝑧 𝑥1 𝑥2 𝑠1 𝑠2 𝑠3 𝐴1 𝑏 Min.+ve
ratio
5 0 13 0 0 2 5M 80
0 5 7 -0 0 1 0 40
0 0 9 0 5 1 0 45
0 0 -1 5 0 1 -5 15
Since, there is no –ve element in first row, it has optimal solution.

Equating, we get

5𝑧 = 80 → 𝑧 = 16

5𝑥1 = 40 → 𝑥1 = 8

𝑥2 is non basic variable. 𝑥2 = 0

Hence maximum value = 16 at the point (8, 0)

Solve by Big M method:

Maximize(𝑧) = 2𝑥1 + 𝑥2 subject to constraints

2𝑥1 + 𝑥2 ≤ 2, 𝑥1 + 2𝑥2 ≥ 6, 𝑥1 + 𝑥2 ≤ 4, 𝑥1 , 𝑥2 ≥ 0

Solution: Let us introduce slack variables, surplus variable and artificial variable.
The normal form of given LPP is

𝑧 − 2𝑥1 − 𝑥2 + 𝑀𝐴2 + 0𝑠1 + 0𝑠2 + 0𝑠3 = 0

2𝑥1 + 𝑥2 + 𝑠1 = 2

𝑥1 + 2𝑥2 − 𝑠2 + 𝐴2 = 6

𝑥1 + 𝑥2 + 𝑠3 = 4

Where, slack variables = 𝑠1, 𝑠3

Surplus variable = 𝑠2 and artificial variable = 𝐴2. M is very large positive number.
The product of 𝑀𝐴2 is subtracted from objectives.

IBFS table

𝑧 𝑥1 𝑥2 𝑠1 𝑠2 𝑠3 𝐴2 𝑏 Min.+ve
1 -2 -1 0 0 0 M 0
0 2 1 1 0 0 0 2
0 1 2 0 -1 0 1 6
0 1 1 0 0 1 0 4
Apply : 𝑅1 → 𝑅1 − 𝑀𝑅3

𝑧 𝑥1 𝑥2 𝑠1 𝑠2 𝑠3 𝐴2 𝑏 Min.+ve
1 -2-M -1-2M 0 M 0 0 -6M −6𝑀
=infinity
−1−2𝑀
0 2 1 1 0 0 0 2 2
= 2(min)
1
0 1 2 0 -1 0 1 6 6
=3
2
0 1 1 0 0 1 0 4 4
=4
1
In first row the greatest negative element is -1-2M.

𝑥2 is pivot column, 𝑅2 is pivot row and 1is pivot element.

Apply: 𝑅1 → 𝑅1 + (1 + 2𝑀 )𝑅2, 𝑅3 → 𝑅3 − 2𝑅2 , 𝑅4 → 𝑅4 − 𝑅2

𝑧 𝑥1 𝑥2 𝑠1 𝑠2 𝑠3 𝐴2 𝑏 Min.+ve
1 3M 0 1+2M 0 0 0 2-2M
0 2 1 1 0 0 0 2
0 -3 0 -2 -1 0 1 2
0 -1 0 -1 0 1 0 0
Since, there is no negative element in first row. It has optimal solution

Equating, we get

𝑧 = 2 − 2𝑀, 𝑥1 is non basic variable ie 𝑥1 = 0, 𝑥2 = 2, 𝐴2 = 2

We have

Objective function= 𝑧 − 𝑀𝐴2

Then 𝑧 − 𝑀𝐴2 = 2 − 2𝑀

𝑧 − 𝑀. 2 = 2 − 2𝑀

𝑍 − 2𝑀 = 2 − 2𝑀

𝑍=2

Hence maximum value = 2 at (0, 2).