Linear Programming for JEE Main: Corner Point Method

Linear Programming is one of the most accessible chapters in JEE Main Mathematics, contributing one to two marks every session. The algorithm is mechanical — identify the feasible region, find the corner points, evaluate the objective function at each corner — and the same procedure works for every problem. A student who can draw constraint lines accurately and identify the feasible region reliably will always get full marks here in under five minutes.

Formulating the Linear Programming Problem

Every LPP has three components: (1) decision variables (x and y, the quantities to optimise); (2) objective function Z = ax + by to maximise or minimise; (3) constraints — linear inequalities that x and y must satisfy (including non-negativity constraints x ≥ 0, y ≥ 0). JEE presents LPP problems in two ways: directly as mathematical constraints, or as a word problem (production, resource allocation) that you must translate into constraints. The translation step is where most students lose marks — make sure the inequality sign is consistent with the physical meaning (a limited resource gives ≤; a minimum requirement gives ≥).

Non-negativity constraints restrict the solution to the first quadrant of the xy-plane. Each constraint line divides the plane into two half-planes; the feasible region is the intersection of all the half-planes satisfying all constraints. To identify which side of each constraint line is in the feasible region, substitute the origin (0,0): if the origin satisfies the inequality, the feasible region is on the side containing the origin; otherwise it is on the other side. This substitution check is faster and more reliable than reasoning about the inequality sign direction. Take a free optimisation mock to practise LPP formulation.

The Corner Point Theorem

Fundamental theorem: if the objective function Z has an optimal value (maximum or minimum) in a bounded feasible region, it occurs at one of the corner points (vertices) of the region. Finding the corner points requires solving pairs of constraint boundary lines simultaneously — each corner is the intersection of two boundary lines. With n constraints, there are at most nC2 potential corners, but only those satisfying all other constraints are actual corners of the feasible region.

Procedure: (1) Draw all constraint lines. (2) Shade the feasible region (intersection of all half-planes). (3) Identify all corner points and find their coordinates. (4) Evaluate Z at every corner. (5) Report the maximum/minimum and the corresponding point. If the objective function is parallel to one of the boundary lines of the feasible region, the optimal value occurs along that entire edge (infinitely many optimal solutions) — a subtle case that JEE occasionally tests.

Unbounded Regions and Infeasibility

If the feasible region is unbounded (extends to infinity in some direction), the optimal value may or may not exist. For maximisation in an unbounded region: check if the objective function can grow without bound in the feasible direction — if it can, no maximum exists. For minimisation, find the corner-point minimum Z₀ and check whether the open half-plane Z < Z₀ intersects the feasible region: if it does, the minimum does not exist; if it does not, Z₀ is the minimum. JEE tests "which of the following statements is correct about this LPP" when the region is unbounded.

Infeasibility occurs when the intersection of all constraint half-planes is empty. This is detected by finding that no point simultaneously satisfies all constraints. In a JEE LPP question, if the constraints lead to an empty feasible region, the problem has no solution. For the algebraic techniques underlying optimisation, see our matrices guide and for the broader applied mathematics context, our Math 2026 strategy guide.