Home > Operation Research > Simplex method example

2. Simplex method example ( Enter your problem )
  1. Structure of Linear programming problem
  2. Algorithm (using `Z`-row method)
  3. Maximization example-1 (using `Z`-row method)
  4. Maximization example-2 (using `Z`-row method)
  5. Maximization example-3 (using `Z`-row method)
  6. BigM method Algorithm (using `Z`-row method)
  7. Minimization example-1 (using `Z`-row method)
  8. Minimization example-2 (using `Z`-row method)
  9. Minimization example-3 (using `Z`-row method)
  10. Degeneracy example-1 (Tie for leaving basic variable) (using `Z`-row method)
  11. Degeneracy example-2 (Tie first Artificial variable removed) (using `Z`-row method)
  12. Unrestricted variable example (using `Z`-row method)
  13. Multiple optimal solution example (using `Z`-row method)
  14. Infeasible solution example (using `Z`-row method)
  15. Unbounded solution example (using `Z`-row method)
  16. Algorithm (using `Z_j-C_j` method)
  17. Maximization example-1 (using `Z_j-C_j` method)
  18. Maximization example-2 (using `Z_j-C_j` method)
  19. Maximization example-3 (using `Z_j-C_j` method)
  20. BigM method Algorithm (using `Z_j-C_j` method)
  21. Minimization example-1 (using `Z_j-C_j` method)
  22. Minimization example-2 (using `Z_j-C_j` method)
  23. Minimization example-3 (using `Z_j-C_j` method)
  24. Degeneracy example-1 (Tie for leaving basic variable) (using `Z_j-C_j` method)
  25. Degeneracy example-2 (Tie first Artificial variable removed) (using `Z_j-C_j` method)
  26. Unrestricted variable example (using `Z_j-C_j` method)
  27. Multiple optimal solution example (using `Z_j-C_j` method)
  28. Infeasible solution example (using `Z_j-C_j` method)
  29. Unbounded solution example (using `Z_j-C_j` method)
  30. Algorithm (using `C_j-Z_j`method)
  31. Maximization example-1 (using `C_j-Z_j`method)
  32. Maximization example-2 (using `C_j-Z_j`method)
  33. Maximization example-3 (using `C_j-Z_j`method)
  34. BigM method Algorithm (using `C_j-Z_j`method)
  35. Minimization example-1 (using `C_j-Z_j`method)
  36. Minimization example-2 (using `C_j-Z_j`method)
  37. Minimization example-3 (using `C_j-Z_j`method)
  38. Degeneracy example-1 (Tie for leaving basic variable) (using `C_j-Z_j`method)
  39. Degeneracy example-2 (Tie first Artificial variable removed) (using `C_j-Z_j`method)
  40. Unrestricted variable example (using `C_j-Z_j`method)
  41. Multiple optimal solution example (using `C_j-Z_j`method)
  42. Infeasible solution example (using `C_j-Z_j`method)
  43. Unbounded solution example (using `C_j-Z_j`method)
Other related methods
  1. Formulate linear programming model
  2. Graphical method
  3. Simplex method (BigM method)
  4. Two-Phase method
  5. Primal to dual conversion
  6. Dual simplex method
  7. Integer simplex method
  8. Branch and Bound method
  9. 0-1 Integer programming problem
  10. Revised Simplex method

23. Minimization example-3 (using `Z_j-C_j` method)
(Previous example)
25. Degeneracy example-2 (Tie first Artificial variable removed) (using `Z_j-C_j` method)
(Next example)

24. Degeneracy example-1 (Tie for leaving basic variable) (using `Z_j-C_j` method)





Degeneracy example-1 (Tie for leaving basic variable)
During solving LP problem, a situation may arise in which there is a tie between, 2 or more basic variables for leaving the basis. (means minimum ratios are same).
It is called degeneracy and to resolve this we can select any of them arbitrarily.
But if artificial variable is present then it must be removed first.
Example
Find solution using Simplex method (BigM method)
MAX Z = 3x1 + 9x2
subject to
x1 + 4x2 <= 8
x1 + 2x2 <= 4
and x1,x2 >= 0;


Solution:
Problem is
Max `Z``=````3``x_1`` + ``9``x_2`
subject to
`````x_1`` + ``4``x_2``8`
`````x_1`` + ``2``x_2``4`
and `x_1,x_2 >= 0; `


The problem is converted to canonical form by adding slack, surplus and artificial variables as appropiate

1. As the constraint-1 is of type '`<=`' we should add slack variable `S_1`

2. As the constraint-2 is of type '`<=`' we should add slack variable `S_2`

After introducing slack variables
Max `Z``=````3``x_1`` + ``9``x_2`` + ``0``S_1`` + ``0``S_2`
subject to
`````x_1`` + ``4``x_2`` + ````S_1`=`8`
`````x_1`` + ``2``x_2`` + ````S_2`=`4`
and `x_1,x_2,S_1,S_2 >= 0`


Tableau-1`C_j``3``9``0``0`
`C_B``"Basis"``x_1``x_2``S_1``S_2``RHS``"Ratio"=(RHS)/(x_2)`
`R_1` `0``S_1``1``4``1``0``8``(8)/(4)=2`
`R_2` `0``S_2``1``(2)``0``1``4``(4)/(2)=2``->`
`Z_j``0``0``0``0``Z=0`
`Z_j-C_j``-3``-9``uarr``0``0`


Most Negative `Z_j-C_j` is `-9`. So, the entering variable is `x_2`.

Minimum ratio is `2`. So, the leaving basis variable is `S_2`.

`:.` The pivot element is `2`.

Entering `=x_2`, Departing `=S_2`, Key Element `=2`
`R_2`(new)`= R_2`(old) `-: 2`
`x_1``x_2``S_1``S_2``RHS`
`R_2`(old) = `1``2``0``1``4`
`R_2`(new)`= R_2`(old) `-: 2``0.5``1``0``0.5``2`
`R_1`(new)`= R_1`(old) - `4 R_2`(new)
`x_1``x_2``S_1``S_2``RHS`
`R_1`(old) = `1``4``1``0``8`
`R_2`(new) = `0.5``1``0``0.5``2`
`4 xx R_2`(new) = `2``4``0``2``8`
`R_1`(new)`= R_1`(old) - `4 R_2`(new)`-1``0``1``-2``0`


Tableau-2`C_j``3``9``0``0`
`C_B``"Basis"``x_1``x_2``S_1``S_2``RHS``"Ratio"`
`R_1` `0``S_1``-1``0``1``-2``0`
`R_2` `9``x_2``0.5``1``0``0.5``2`
`Z_j``4.5``9``0``4.5``Z=18`
`Z_j-C_j``1.5``0``0``4.5`


Since all `Z_j-C_j >= 0`

Hence, optimal solution is arrived with value of variables as :
`x_1=0,x_2=2`

Max `Z=18`




This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



23. Minimization example-3 (using `Z_j-C_j` method)
(Previous example)
25. Degeneracy example-2 (Tie first Artificial variable removed) (using `Z_j-C_j` method)
(Next example)





Share this solution or page with your friends.
 
 
Copyright © 2026. All rights reserved. Terms, Privacy
 
 

.