Indian Institute of Technology Patna
CDA, Mathematics II, Spring 2023-24
Tutorial Sheet-5
Simplex Method and special cases
distributed by
Dr. Mahendra Kumar Gupta
1. Solve the following LPP by Simplex Method 2x1 − x2 ≤ 40
x1 ≥ 0, x2 ≥ 0
max z = 3x1 + 5x2 + 4x3
subect to 5. Show the following LPP by Simplex method and
2x1 + 3x2 ≤ 8 show that feasible region is unbounded but
3x1 + 2x2 + 4x3 ≤ 15 optimal solution exits.
2x2 + 5x3 ≤ 10
min z = −6x1 + 2x2
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0
subect to
(solved in class) 2x1 − x2 ≤ 2
x1 ≤ 4
2. Solve the following LPP by Simplex Method
(Use Big-M Method). x1 ≥ 0, x2 ≥ 0
min z = x1 − 3x2 6. (Degeneracy: when at least one basic variable
subect to is zero.) Show the following LPP by Simplex
2x1 + 3x2 ≤ 4
method and show that the degeneracy occurs.
3x1 + 4x2 ≥ 3
x1 + 2x2 = 5 min z = 5x1 + 2x2
x2 ≥ 0 subect to
3x1 + x2 = 4
3. Show the following LPP by Simplex method.
2x1 + x2 ≥ 3
min z = x1 + x2 x1 + 2x2 ≤ 3
subect to x1 ≥ 0, x2 ≥ 0
3x1 + 2x2 ≥ 30
2x1 + 3x2 ≥ 30 7. Alternative Optima: Solve the following LPP
x1 + x2 ≤ 5 max z = x1 + x2
x1 ≥ 0, x2 ≥ 0
subject to
4. Show the following LPP by Simplex method.
x1 + 2x2 ≤ 20
max z = −2x1 + x2 x1 + x2 ≤ 15
subect to x2 ≤ 6
x1 − x2 ≤ 10 x1 , x2 ≥ 0
Answers of selected problems: Q1 Optimal Point (x1 , x2 , x3 ) = ( 41 41 . Q2 Optimal
, 41 , 41 ), max z = 765
89 50 62
Point (x1 , x2 ) = (−7, 6), min z = −25. Q3 In the optimum table, arti cial variables are present in the basic
variables and they have non-zero values. Therefore, the problem is infeasible and there is no solution. Q4
one zj − cj is negative and all the elements in that column are negative or zero. Therefore feasible region
is unbounded and optimal solution is also unbounded. Q5 Optimal Point (x1 , x2 ) = (4, 6), min z = −12.
In atleast one ( rst) simplex table, all elements of a column are negative or zero. That shows that feasible
region is unbounded. Q6 Optimal Point (x1 , x2 ) = (1, 1), min z = 7 The 3rd basic variable is zero. There is
a tie in the minimum ratio rule, it can be broken arbitrarily and degeneracy occurs. Q7 The problem has
alternative optima. All points between (10,5) to (15,0) are optimal solution with unique z=15
