Simplex Method Calculator
Type the objective and the constraints to solve the linear programme.
A linear expression to maximise or minimise, such as 3x + 2y.
Linear constraints with <=, >= or =, separated by semicolons. Every variable is taken as ≥ 0.
Result
You entered
Point
Show the work
Standard form
Every right side is made ≥ 0; each ≤ gets a slack variable (s), each ≥ a surplus (e) and an artificial variable (a), each = an artificial; all variables are ≥ 0.
Using
Pivot: x enters, s3 leaves
The most useful column is the first with a negative entry in the bottom row (Bland's rule, which never cycles); the ratio test (RHS ÷ positive entries of that column) picks the row whose limit is smallest.
Pivot: y enters, s1 leaves
The most useful column is the first with a negative entry in the bottom row (Bland's rule, which never cycles); the ratio test (RHS ÷ positive entries of that column) picks the row whose limit is smallest.
Tableaux
The tableaux; the bottom row holds z_j − c_j and, last, the value of the objective.
Optimal
No entry of the bottom row is negative, so no move improves the objective: this corner is optimal. Read each basic variable from its row; the others are 0.
Result
The maximum value and where it is reached.