Integer simplex method (gomory's cutting plane method) calculator

We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more

Support us

Home

What's new

College Algebra

Games

Feedback

About us

Algebra

Matrix & Vector

Numerical Methods

Statistical Methods

Operation Research

Word Problems

Calculus

Geometry

Pre-Algebra

Home > Operation Research calculators > Integer Simplex method (Gomory's cutting plane method) calculator

Algorithm and examples

Method

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

Type your linear programming problem

Total Variables : Total Constraints :

Click On Generate

Display solution steps in :

Entering variable using Row `Z_j-C_j` or `C_j-Z_j` :

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

Alternate Solution (if exists) Artificial Column Remove Subtraction Steps

Min ratios are same then exit row option :

Print Digit =

Entering variable using `Z` or `Z_j-C_j` or `C_j-Z_j` Row for Simplex and Two-phase method (developed on 16.03.2026).
For wrong solution or any other table display format or any other new solution method,
please submit the feedback form. So I will try my best to develop it soon.

SolutionHelp