You now know how to formulate a linear programming problem and how to graph its feasible region. But the feasible region typically contains infinitely many points — so how do you find the one combination that gives the maximum or minimum value of the objective function without checking every single point? This is exactly what the Corner Point Method solves, and it is the technique you will use to answer nearly every LPP question in your board exam.

The Two Theorems Behind the Method

The Corner Point Method rests on two important theorems your textbook states without proof (beyond the Class 12 syllabus, but essential to memorise).

Theorem 1: If the feasible region is a convex polygon and Z = ax + by has an optimal value (maximum or minimum), it must occur at a corner point (vertex) — never at some random interior point.

Theorem 2: If the feasible region is bounded, Z is guaranteed to have both a maximum and a minimum value, each occurring at a corner point.

Together, these theorems mean you never need to test infinite interior points — only the handful of corner points, which are simply the intersections of the boundary lines.

The Corner Point Method — Step by Step

  1. Graph the feasible region for the given system of constraints and identify all its corner points, either by inspection or by solving pairs of boundary equations simultaneously.

  2. Evaluate the objective function Z = ax + by at every corner point of the region.

  3. Identify M and m — the largest and smallest values obtained among all the corner points.

  4. If the feasible region is bounded, M is the maximum value of Z and m is the minimum value of Z. You’re done.

  5. If the feasible region is unbounded, additional checks are needed before you can be sure M or m is truly the maximum or minimum (this special case is covered in the next post of this series).

Solved Example 1 — Maximising an Objective Function

Problem: Maximise Z = 4x + y, subject to the constraints x + y ≤ 50, 3x + y ≤ 90, x ≥ 0, y ≥ 0.

Step 1 — Graph the constraints. Plotting x + y ≤ 50 and 3x + y ≤ 90 with the non-negative restrictions gives a bounded, four-cornered feasible region.

Step 2 — Identify the corner points. Solving the boundary equations at their intersections gives vertices O(0, 0), A(30, 0), B(20, 30), and C(0, 50).

Step 3 — Evaluate Z at each corner:

Corner PointZ = 4x + y
O (0, 0)0
A (30, 0)120
B (20, 30)110
C (0, 50)50

Step 4 — Conclusion. The largest value, 120, occurs at A(30, 0). Since the feasible region is bounded, the maximum value of Z is 120, achieved when x = 30 and y = 0.

Solved Example 2 — Minimising an Objective Function

Problem: Minimise Z = 200x + 500y, subject to x + 2y ≥ 10, 3x + 4y ≤ 24, x ≥ 0, y ≥ 0.

Step 1 — Graph the constraints. Note that this time one constraint uses ”≥,” which flips the shading direction compared to a ”≤” constraint. The resulting feasible region ABC is bounded.

Step 2 — Identify the corner points. The vertices work out to A(0, 5), B(4, 3), and C(0, 6).

Step 3 — Evaluate Z at each corner:

Corner PointZ = 200x + 500y
A (0, 5)2500
B (4, 3)2300
C (0, 6)3000

Step 4 — Conclusion. The smallest value, 2300, occurs at B(4, 3). Since the region is bounded, the minimum value of Z is 2300, achieved when x = 4 and y = 3.

Why Solving Simultaneous Equations Matters

Notice that finding each corner point often requires solving two boundary equations simultaneously — for instance, where x + y = 50 intersects 3x + y = 90. This is pure Class 10-level algebra, but a small arithmetic slip here cascades into a wrong final answer even if your graphing is perfect. Always double-check corner point coordinates before evaluating Z.

A Quick Reference for Exams

  • Always list corner points systematically in a table before evaluating Z — this format is exactly what CBSE examiners expect and award marks for.

  • Underline or circle the maximum/minimum value in your table so the examiner can see your final answer clearly.

  • State your conclusion in words: “the maximum value of Z is ___, occurring at (x, y) = ___” — a numeric table alone without this sentence sometimes loses presentation marks.

  • Remember Theorem 2 applies only when the region is bounded; for unbounded regions, extra verification is required, which the next post covers in detail.

Practice the Corner Point Method on ChampionsPrep

Reading tables and formulas is only half the battle — real exam speed comes from solving problems end-to-end under time pressure. ChampionsPrep offers AI-powered, chapter-wise practice sessions with PrepCoin packs from ₹59, covering CBSE and Maharashtra State Board Class XI–XII Commerce topics, along with focused preparation for CUET, IPMAT, JIPMAT, NPAT, and SET. Practise the Corner Point Method on fresh problems until your solutions are fast and error-free — start your session on ChampionsPrep today.

Corner Point Method Explained: Step-by-Step Solved Examples podcast artwork
Audio LessonClass 12

Corner Point Method Explained: Step-by-Step Solved Examples

ChampionsPrep MathematicsEpisode 12612:13

Subscribe in any podcast app:

Frequently Asked Questions

What is the Corner Point Method in linear programming? +

It is a technique where the objective function is evaluated only at the corner points (vertices) of the feasible region to find its maximum or minimum value, based on the theorem that optimal values always occur at corner points.

Why don't we need to check every point in the feasible region? +

Because Theorem 1 guarantees that if an optimal value exists, it must occur at a corner point of the feasible region, making it unnecessary to test the infinite interior points.

What happens if two corner points give the same maximum value? +

This indicates multiple optimal solutions - every point on the line segment joining those two corner points will also give the same maximum value.

Does the Corner Point Method work for unbounded feasible regions? +

It still identifies candidate values at corner points, but for unbounded regions you must perform an additional check to confirm whether a true maximum or minimum actually exists.

How many corner points does a typical Class 12 LPP feasible region have? +

Most textbook problems involve three to five corner points, though this can vary depending on the number and complexity of the constraints given.