Linear programming
Lay constraints, the objective direction, and the vertex candidates over one feasible region, and use three views to confirm where a linear optimum appears.
Linear programming
4 pieces about this concept, across works, topic guides, and exam visualizations.
Topics
Works
Constraint half-planes and the feasible region
Drag the constraint lines and watch how the half-plane masks and the convex feasible polygon change as they intersect.
Level curves of the objective
Drag a level line of the objective z=px+qy and watch the whole plane split into layers by a family of parallel lines.
Finding the optimal solution at a vertex
Visit each vertex of the feasible region, compute z=px+qy, and read from the candidate table where the optimal solution lies.