Vertices of the Feasible Region
What you'll learn: How to find the corner points of a feasible region by solving systems of equations where boundary lines intersect.
Why Corners Matter
When you graph a system of linear inequalities, you shade a region called the feasible region — the area where all inequalities are satisfied at once. This region is often shaped like a polygon. The vertices (corner points) of this polygon are critically important because, in optimization problems, the best solutions typically occur at these corners.
How to Find Vertices
Each vertex occurs where two boundary lines meet. To find a vertex:
- Identify which boundary lines intersect at that corner
- Temporarily treat the inequalities as equations (replace ≤ or ≥ with =)
- Solve the resulting system of two equations using substitution or elimination
- The solution (x, y) is your vertex
Example Walkthrough
Suppose your feasible region is bounded by:
- x + y ≤ 10 (boundary line: x + y = 10)
- 2x + y ≤ 14 (boundary line: 2x + y = 14)
- x ≥ 0, y ≥ 0 (the axes)
To find where the first two lines intersect:
- Solve x + y = 10 and 2x + y = 14 simultaneously
- Subtract the first from the second: (2x + y) - (x + y) = 14 - 10
- This gives x = 4
- Substitute back: 4 + y = 10, so y = 6
- Vertex: (4, 6)
You'd repeat this process for every pair of intersecting boundaries.
Key Takeaway: Vertices are found by solving systems formed where boundary lines meet — treat each pair of intersecting boundary lines as a two-equation system and solve for the coordinates.