Max of px + qy at a corner where a₁x + b₁y ≤ c₁ and a₂x + b₂y ≤ c₂ meet: if (p, q) = u(a₁, b₁) + v(a₂, b₂) with u, v ≥ 0, then px + qy ≤ uc₁ + vc₂ everywhere in the region, with equality at the corner. For a minimum over ≥ constraints, the same rule gives a lower bound.
| Ratio p/q of the profits | Optimal corner | Maximum |
|---|---|---|
| p/q < 1 | (0, 8) | 8q |
| p/q = 1 | every point of the edge from (0, 8) to (5, 3) | 8q |
| 1 < p/q < 3 | (5, 3) | 5p + 3q |
| p/q = 3 | every point of the edge from (5, 3) to (6, 0) | 6p |
| p/q > 3 | (6, 0) | 6p |
Key takeaways: a corner is optimal when the objective's coefficient pair is a non-negative combination of the coefficient pairs of the constraints meeting there. Setting each multiplier ≥ 0 gives the range of a coefficient directly; at the ends of the range two corners tie, and beyond them the optimum jumps to the neighbouring corner.