Linear Programming carries 5 marks in the 2026-27 weightage, and most of those marks come from one technique: the corner point method. The method is short, but it has one subtle step that many students skip, the half-plane check for unbounded regions. After this article you will be able to find the feasible region, list its corners, evaluate the objective function and decide correctly whether a maximum or minimum actually exists.

Why the corners are enough

An objective function \(Z = ax + by\) is linear. Its level lines \(ax + by = k\) are parallel straight lines. As you increase \(k\), the line slides across the plane in one direction. The last point (or points) of the feasible region the line touches before leaving it gives the maximum, and the first point it touches gives the minimum. For a region bounded by straight lines, that first or last contact always happens at a corner, or along an edge joining two corners.

This is the corner point theorem: if an optimal value exists, it occurs at a corner point of the feasible region. If the region is bounded, both the maximum and the minimum exist.

The corner point method

  1. Draw each constraint line using its intercepts, and shade the side that satisfies the inequality (test the origin if the line does not pass through it).
  2. Identify the feasible region, the area common to all constraints including \(x, y \ge 0\).
  3. Find every corner point. Intercepts give some; solve pairs of line equations for the rest.
  4. Evaluate \(Z\) at each corner in a table.
  5. Bounded region: the largest value is the maximum and the smallest is the minimum. Done.
  6. Unbounded region: apply the half-plane check before concluding (explained below).

Worked example 1: a bounded region

Maximise \(Z = 3x + 5y\) subject to \(x + 2y \le 10\), \(3x + y \le 15\), \(x, y \ge 0\).

Lines: \(x + 2y = 10\) passes through \((10,0)\) and \((0,5)\); \(3x + y = 15\) passes through \((5,0)\) and \((0,15)\). The origin satisfies both, so the feasible region lies towards the origin. It is a bounded quadrilateral.

Intersection: from \(3x + y = 15\), \(y = 15 – 3x\). Substituting, \(x + 30 – 6x = 10\), so \(x = 4\), \(y = 3\).

Corner \(Z = 3x + 5y\)
\((0,0)\) 0
\((5,0)\) 15
\((4,3)\) 27
\((0,5)\) 25

Maximum \(Z = 27\) at \(x = 4\), \(y = 3\). Note that \((10,0)\) and \((0,15)\) are not corners of the feasible region: each violates the other constraint.

Unbounded regions and the half-plane check

When the feasible region stretches to infinity, an optimum may not exist. Suppose the corner table suggests a maximum \(M\). Draw the open half-plane \(ax + by > M\). If it has no point in common with the feasible region, \(M\) is the maximum. If it does share points, \(Z\) has no maximum. For a minimum \(m\), check the half-plane \(ax + by < m\) in the same way.

Never skip this line in an unbounded question: state the half-plane, say whether it meets the feasible region, and conclude. The corner table alone does not prove anything for an unbounded region.

Worked example 2: minimum on an unbounded region

Minimise \(Z = 4x + 3y\) subject to \(x + y \ge 6\), \(2x + y \ge 8\), \(x, y \ge 0\).

The origin fails both constraints, so the region lies away from the origin and is unbounded. Corners: \((0,8)\) from \(2x + y = 8\) on the y-axis, \((6,0)\) from \(x + y = 6\) on the x-axis, and the intersection of the two lines: subtracting gives \(x = 2\), then \(y = 4\).

Corner \(Z = 4x + 3y\)
\((0,8)\) 24
\((2,4)\) 20
\((6,0)\) 24

Check: draw \(4x + 3y < 20\), the side of the line through \((5,0)\) and \((0,\frac{20}{3})\) containing the origin. On the graph it has no point in common with the feasible region. (An algebraic confirmation: \(4x + 3y = 2(x+y) + (2x+y) \ge 2(6) + 8 = 20\) for every feasible point.) So the minimum is \(Z = 20\) at \((2,4)\).

Worked example 3: no maximum

On the same region, maximise \(Z = x + 2y\).

Corner values: \((0,8) \to 16\), \((2,4) \to 10\), \((6,0) \to 6\). The largest is 16, but check \(x + 2y > 16\). The point \((0,10)\) satisfies \(x + y = 10 \ge 6\) and \(2x + y = 10 \ge 8\), so it is feasible, and there \(Z = 20 > 16\). The half-plane meets the region, so \(Z\) has no maximum value. Moving further up the y-axis makes \(Z\) as large as you like.

Worked example 4: a tie between corners

On the same region, minimise \(Z = 2x + 2y\).

Corner values: \((0,8) \to 16\), \((2,4) \to 12\), \((6,0) \to 12\). The smallest value, 12, occurs at two adjacent corners. Check \(2x + 2y < 12\), i.e. \(x + y < 6\): this contradicts the constraint \(x + y \ge 6\), so there is no common point. The minimum is 12, attained at every point on the segment joining \((2,4)\) and \((6,0)\). This happens because the objective line is parallel to the boundary \(x + y = 6\).

Presenting your answer neatly

A well-organised LPP answer usually has four visible parts: the graph with each line labelled and the feasible region shaded, a list of corner points with how each was found, the table of \(Z\)-values, and a final sentence. For unbounded regions, add the half-plane statement just before the conclusion. Keeping this order makes your working easy to follow and helps you catch a missing corner before you finish.

Common mistakes

  • Including false corners, such as an intercept that lies outside another constraint. Check each corner in all inequalities.
  • Shading the wrong side of a “\(\ge\)” constraint. Always test a point.
  • Declaring a max or min on an unbounded region without the half-plane check.
  • Missing multiple optima: if two adjacent corners tie, every point on the edge between them is optimal.
  • Arithmetic slips at the intersection. Substitute your point back into both equations.
  • Forgetting the final statement: give the optimal value and where it occurs.

Practise next

Practise drawing feasible regions on the graphical method topic page, and convert word problems into constraints on terminology and formulation. Then sign up for a free student account and take a timed test on the Linear Programming chapter.

Frequently asked questions

Does a bounded feasible region always have both a maximum and a minimum?

Yes. If the feasible region is bounded, the objective function has both a maximum and a minimum value, and each occurs at a corner point.

What is the half-plane check?

For an unbounded region, if the corner table suggests a maximum \(M\), check whether \(ax + by > M\) shares any point with the feasible region. If it does not, \(M\) is the maximum; if it does, there is no maximum. Use \(ax + by < m\) for a minimum.

What if two corners give the same optimal value?

If they are adjacent corners, every point on the line segment joining them gives that optimal value, so there are infinitely many optimal solutions.

Can the feasible region be empty?

Yes. If no point satisfies all constraints together, the problem has no feasible solution and therefore no optimal value.