Skip to main content

Linear Programming Calculator

linear programming calculator. Get instant, accurate results. Enter values for instant results with step-by-step formulas.

Reviewed by Manoj Kumar, Mathematics Educator

Reviewed by Manoj Kumar, Mathematics Educator

Formula

Maximize Z = cx subject to Ax ≤ b, x ≥ 0

Solves 2-variable LP graphically by evaluating the objective at each vertex of the feasible region.

Worked Examples

Example 1: 3-constraint problem

Problem:Max 3x+5y, s.t. x+2y≤14, 3x+y≤14, x+y≤8

Solution:Evaluate Z at each vertex of feasible region

Result:Optimal Z

Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy