2-Variable Linear Programming

Maximize c₁x + c₂y subject to inequalities (corner-point method).

Problem

Objective: maximize c1 x + c2 y

Constraints (a b <= c, one per line)

x ≥ 0, y ≥ 0 assumed

Result

Enter LP.