Solve the Linear programming problem using
Integer simplex method (gomory's cutting plane method)

Type your linear programming problem


OR

Total Variables :
Total Constraints :



Click On Generate


Mode :


Find


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