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
max Z = x1 + x2 subject to 3x1 + 2x2 <= 5 x2 <= 2 and x1,x2 non-negative integers max Z = 2x1 + 20x2 - 10x3 subject to 2x1 + 20x2 + 4x3 <= 15 6x1 + 20x2 + 4x3 = 20 and x1,x2,x3 non-negative integers max Z = 3x1 + 12x2 subject to 2x1 + 4x2 <= 7 5x1 + 3x2 <= 15 and x1,x2 non-negative integers max Z = -3x1 + x2 + 3x3 subject to -x1 + 2x2 + x3 <= 4 2x2 - 3/2x3 <= 1 x1 - 3x2 + 2x3 <= 3 and x1,x2 >= 0 and x3 non-negative integers max Z = x1 + x2 subject to 3x1 + 2x2 <= 5 x2 <= 2 and x2 >= 0 and x1 non-negative integers