Solving Linear Programming Problems Graphically
What you'll learn: You'll discover how to find the best possible solution to a linear programming problem by graphing constraints, identifying corner points, and testing your objective function.
The Big Picture
Linear programming helps you find the optimal (maximum or minimum) value under certain restrictions. You've already learned to graph systems of inequalities, find the feasible region's vertices, and understand the Corner Point Theorem—which tells us the optimal solution lives at a corner point. Now we bring it all together into a complete problem-solving process.
The Step-by-Step Process
1. Graph the constraints
Plot each inequality on the coordinate plane. The overlapping shaded region is your feasible region—the set of all solutions that satisfy every constraint.
2. Find the vertices (corner points)
Identify where the boundary lines intersect. These vertices are candidates for the optimal solution. If your feasible region is bounded, you'll have a finite number of corners. If unbounded, you may have infinitely many points going off in some direction.
3. Evaluate the objective function at each vertex
Plug the coordinates of each corner point into your objective function (like P = 3x + 5y). Calculate the value at every vertex.
4. Identify the optimal solution
Compare all the values. The vertex giving the largest value is your maximum; the one giving the smallest value is your minimum. If the region is unbounded in the direction your objective function improves, there might be no maximum (or no minimum).
Analogy: Think of it like searching for the highest point in a fenced yard. The Corner Point Theorem says the highest elevation must be at one of the fence corners—you don't need to check every point inside, just the corners!
Key Takeaway: To solve a linear programming problem graphically, graph all constraints to find the feasible region, locate its vertices, evaluate the objective function at each vertex, and choose the vertex that optimizes your goal.