Method
1. Simplex method (BigM method)
2. TwoPhase method
3. Dual simplex method
4. Integer simplex method
5. Graphical method
6. Primal to Dual
7. Branch and Bound method
8. 0-1 Integer programming problem
9. Revised Simplex method
min Z = x1 + x2 subject to 2x1 + x2 >= 4 x1 + 7x2 >= 7 and x1,x2 >= 0 min Z = 5x1 + 2x2 + 10x3 subject to x1 - x3 <= 10 x2 + x3 >= 10 and x1,x2,x3 >= 0 max Z = 5x1 + 8x2 subject to 3x1 + 2x2 >= 3 x1 + 4x2 >= 4 x1 + x2 <= 5 and x1,x2 >= 0 min Z = 3x1 + 5x2 subject to 2x1 + 8x2 >= 40 3x1 + 4x2 >= 50 and x1,x2 >= 0 max Z = 3x1 + 2x2 + 2x3 subject to 5x1 + 7x2 + 4x3 <= 7 -4x1 + 7x2 + 5x3 >= -2 3x1 + 4x2 - 6x3 >= 29/7 and x1,x2,x3 >= 0 min Z = x1 - 2x2 - 3x3 subject to -2x1 + x2 + 3x3 = 2 2x1 + 3x2 + 4x3 = 1 and x1,x2,x3 >= 0