Linear Programming Calculator

Simplex is the method and linear programming is the question, so both are on this page. The two-variable tab takes up to five constraints in x and y, each of them less than, greater than or equal to a right-hand side, finds every vertex of the feasible region, evaluates the objective at each, and draws the region with the optimum marked. It reports infeasible and unbounded problems as those rather than returning a number. The simplex tab takes up to four variables and three constraints, all of the form a.x less than or equal to b with b not negative, and shows each tableau with the entering and leaving variables and the shadow prices at the end.