How to calculate
Find intersections of pairs of boundary lines and discard points that fail any constraint. The calculator also projects the feasible region onto the objective axis to check for infeasible or unbounded cases and to find optima on regions without corners.
Worked example
Use Objective x coefficient 3 · Objective y coefficient 2 · Optimize Maximize · Variable bounds Require x ≥ 0 and y ≥ 0 · Constraints, one per line as a, b, relation, c 1, 1, <=, 4 / 1, 0, <=, 2. The result is Maximum 10.
Input and result notes
Enter up to 12 constraints in the form ax + by ≤ c, ax + by ≥ c, or ax + by = c. For example, enter 2, 3, <=, 18 for 2x + 3y ≤ 18. Coefficients can be signed integers, decimals, or fractions.
Stanford notes on linear programming and Fourier–Motzkin elimination