Free to use, no account
Linear Programming Calculator
Enter a linear objective and up to eight constraints to solve a two-variable linear program with x and y nonnegative. The two-phase simplex method reports an optimum, infeasibility or unboundedness and shows each pivot.
How does the two-variable simplex calculator work?
It converts constraints into a feasible tableau, uses a Phase I objective when needed, then applies primal simplex pivots to optimize the requested objective. Variables x and y are constrained to be nonnegative.
Frequently asked questions
How does the two-variable simplex calculator work?
It converts constraints into a feasible tableau, uses a Phase I objective when needed, then applies primal simplex pivots to optimize the requested objective. Variables x and y are constrained to be nonnegative.
Are my objective and constraints uploaded?
No. The solver runs in this browser. Your objective and constraints are not sent to a server or saved by this tool.
What format should I use for constraints?
Enter one row per line, such as 1,1 <= 5 or 2,1 >= 4. The first number multiplies x, the second multiplies y, and both variables must be nonnegative.
What do infeasible and unbounded mean?
Infeasible means no point satisfies every entered constraint. Unbounded means a feasible direction lets the requested objective keep improving without a finite optimum.
Does the result prove my real-world model is correct?
No. It solves only the equations you entered. Check units, assumptions and whether the constraints properly describe your decision.