Corner-Point Method definition
The corner-point method solves a two-variable linear optimization problem by comparing the objective at the vertices of a bounded feasible polygon.
Corner-Point Method in a picture
How it works
Graph the constraints and determine all vertices. Substitute each vertex into the linear objective. At least one vertex gives the maximum and at least one gives the minimum. If adjacent vertices share the best value, the whole edge between them shares it.
Worked examples
Maximize 2x + y on the illustrated rectangle.
The four values are 0, 8, 11, and 3. The largest is 11 at (4, 3).
Maximize x on the same rectangle.
The value 4 occurs at both (4, 0) and (4, 3), and every point between them.
How can you find a vertex made by two intersecting boundary lines?
Solve the two boundary equations and check the point against all constraints.
Common mistake
Check all feasible vertices and the boundedness assumptions. An objective may grow without limit on an unbounded region.
Quick check
Can an entire edge be optimal?
Show answer
Yes, when the objective has its best value at both adjacent vertices.
Should you keep an intersection that violates another constraint?
Show answer
No.
Sources
Flashcard
Corner-Point Method
Reveal the definition
The corner-point method solves a two-variable linear optimization problem by comparing the objective at the vertices of a bounded feasible polygon.
Effortless Math. “Corner-Point Method.” Math Dictionary.
