Course contentsShow
← Mathematics
Lesson 306 of 3,1218. Systems of Linear Equations and InequalitiesFree lesson

The Corner Point Theorem

Learn that optimal solutions to linear programming problems occur at vertices of the feasible region.

The Corner Point Theorem

You'll learn why the best solution to a linear programming problem always sits at a corner of the feasible region.

What Is the Corner Point Theorem?

When you're trying to maximize or minimize an objective function (like maximizing profit or minimizing cost) subject to linear constraints, you might think the optimal solution could be anywhere in the feasible region. Surprisingly, that's not true!

The Corner Point Theorem states that if an optimal solution exists, it will occur at one (or more) of the vertices (corner points) of the feasible region.

Why Does This Matter?

Imagine the feasible region as a fenced area on a graph where all your constraints are satisfied. Your objective function is like a tilted plane sliding across this region. The highest or lowest point where this plane touches the feasible region will always be at a corner—never somewhere in the middle of an edge or floating inside the region.

This is incredibly useful because instead of checking infinitely many points inside the region, you only need to test the handful of corner points you found earlier.

How to Use It

  1. Graph your system of linear inequalities
  2. Identify all vertices of the feasible region
  3. Evaluate the objective function at each vertex
  4. The vertex giving the maximum (or minimum) value is your optimal solution

Think of it like checking the temperature at every corner of a room to find the warmest spot—you don't need to check the entire room!

Key Takeaway: The optimal solution to a linear programming problem always occurs at a vertex of the feasible region, so you only need to test corner points, not every point in the region.