Home > Operation Research calculators > Linear Programming > Dual Simplex method example

5. Dual simplex method example ( Enter your problem )
  1. Algorithm (using `Z`-row method)
  2. Example-1 (using `Z`-row method)
  3. Example-2 (using `Z`-row method)
  4. Example-3 (using `Z`-row method)
  5. Algorithm (using `Z_j-C_j` method)
  6. Example-1 (using `Z_j-C_j` method)
  7. Example-2 (using `Z_j-C_j` method)
  8. Example-3 (using `Z_j-C_j` method)
  9. Algorithm (using `C_j-Z_j`method)
  10. Example-1 (using `C_j-Z_j`method)
  11. Example-2 (using `C_j-Z_j`method)
  12. Example-3 (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

2. Example-1 (using `Z`-row method)
(Previous example)
4. Example-3 (using `Z`-row method)
(Next example)

3. Example-2 (using `Z`-row method)





Find solution using dual simplex method
MIN Z = 2x1 + 3x2 + 0x3
subject to
2x1 - x2 - x3 >= 3
x1 - x2 + x3 >= 2
and x1,x2,x3 >= 0;


Solution:

Problem is
Min `Z``=````2``x_1`` + ``3``x_2`
subject to
```2``x_1`` - ````x_2`` - ````x_3``3`
`````x_1`` - ````x_2`` + ````x_3``2`
and `x_1,x_2,x_3 >= 0; `


In order to apply the dual simplex method, convert all `>=` constraint to `<=` constraint by multiply -1.

Problem is
Min `Z``=````2``x_1`` + ``3``x_2`
subject to
` - ``2``x_1`` + ````x_2`` + ````x_3``-3`
` - ````x_1`` + ````x_2`` - ````x_3``-2`
and `x_1,x_2,x_3 >= 0; `


`Z`` - ``2``x_1`` - ``3``x_2`=`0`
` - ``2``x_1`` + ````x_2`` + ````x_3`` + ````S_1`=`-3`
` - ````x_1`` + ````x_2`` - ````x_3`` + ````S_2`=`-2`


Tableau-1
`C_B``"Basis"``x_1``x_2``x_3``S_1``S_2``RHS`
`R_1` `0``Z``-2``-3``0``0``0``0`
`R_2` `0``S_1``(-2)``1``1``1``0``-3``->`
`R_3` `0``S_2``-1``1``-1``0``1``-2`
`"Ratio"=(Z_j)/(S_1,j)`
and `S_1,j<0`
`(-2)/(-2)`
`=1``uarr`
`(-3)/(1)`
`=`---
`(0)/(1)`
`=`---
`(0)/(1)`
`=`---
`(0)/(0)`
`=`---


Most negative `RHS` is `-3`. So, the leaving basis variable is `S_1`.

Least positive ratio is `1`. So, the entering variable is `x_1`.

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

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


Tableau-2
`C_B``"Basis"``x_1``x_2``x_3``S_1``S_2``RHS`
`R_1` `0``Z``0``-4``-1``-1``0``3`
`R_2` `2``x_1``1``-0.5``-0.5``-0.5``0``1.5`
`R_3` `0``S_2``0``0.5``(-1.5)``-0.5``1``-0.5``->`
`"Ratio"=(Z_j)/(S_2,j)`
and `S_2,j<0`
`(0)/(0)`
`=`---
`(-4)/(0.5)`
`=`---
`(-1)/(-1.5)`
`=0.6667``uarr`
`(-1)/(-0.5)`
`=2`
`(0)/(1)`
`=`---


Most negative `RHS` is `-0.5`. So, the leaving basis variable is `S_2`.

Least positive ratio is `0.6667`. So, the entering variable is `x_3`.

`:.` The pivot element is `-1.5`.

Entering `=x_3`, Departing `=S_2`, Key Element `=-1.5`
`R_3`(new)`= R_3`(old) `-: -1.5`
`x_1``x_2``x_3``S_1``S_2``RHS`
`R_3`(old) = `0``0.5``-1.5``-0.5``1``-0.5`
`R_3`(new)`= R_3`(old) `-: -1.5``0``-0.3333``1``0.3333``-0.6667``0.3333`
`R_2`(new)`= R_2`(old) + `0.5 R_3`(new)
`x_1``x_2``x_3``S_1``S_2``RHS`
`R_2`(old) = `1``-0.5``-0.5``-0.5``0``1.5`
`R_3`(new) = `0``-0.3333``1``0.3333``-0.6667``0.3333`
`0.5 xx R_3`(new) = `0``-0.1667``0.5``0.1667``-0.3333``0.1667`
`R_2`(new)`= R_2`(old) + `0.5 R_3`(new)`1``-0.6667``0``-0.3333``-0.3333``1.6667`
`R_1`(new)`= R_1`(old) + `R_3`(new)
`x_1``x_2``x_3``S_1``S_2``RHS`
`R_1`(old) = `0``-4``-1``-1``0``3`
`R_3`(new) = `0``-0.3333``1``0.3333``-0.6667``0.3333`
`R_1`(new)`= R_1`(old) + `R_3`(new)`0``-4.3333``0``-0.6667``-0.6667``3.3333`


Tableau-3
`C_B``"Basis"``x_1``x_2``x_3``S_1``S_2``RHS`
`R_1` `0``Z``0``-4.3333``0``-0.6667``-0.6667``3.3333`
`R_2` `2``x_1``1``-0.6667``0``-0.3333``-0.3333``1.6667`
`R_3` `0``x_3``0``-0.3333``1``0.3333``-0.6667``0.3333`
Ratio


Since all `Z_j <= 0` and all `RHS >= 0`, thus the current solution is the optimal solution.

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

Min `Z=3.3333`




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



2. Example-1 (using `Z`-row method)
(Previous example)
4. Example-3 (using `Z`-row method)
(Next example)





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

.