You’ve now covered every concept needed to tackle the practice exercise at the end of the Linear Programming chapter — formulation, graphing the feasible region, the Corner Point Method, and the special cases of unbounded and infeasible regions. This final post in the series pulls everything together into a practical, exam-focused walkthrough, complete with a fully solved problem, a quick-reference checklist, and the most common mistakes examiners see year after year.

The Structure of Exercise 12.1

The practice exercise in this chapter typically presents around ten problems, falling into a few recognisable patterns:

  • Straightforward maximisation or minimisation with a bounded feasible region (the majority of questions).

  • “Minimise and Maximise” problems asking you to find both values from the same feasible region.

  • Problems with three or more constraints, producing feasible regions with five or more corner points.

  • Occasional special cases — an unbounded region or multiple optimal solutions — designed to test conceptual depth over mechanical repetition.

Recognising which pattern a question follows before you start graphing saves valuable time in the exam hall.

A Fully Solved Practice-Style Problem

Problem: Minimise Z = x + 2y, subject to 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, y ≥ 0. Show that the minimum occurs at more than one point.

Step 1 — Formulate and identify the region type. Both constraints use ”≥,” so the feasible region lies above both boundary lines, extending away from the origin. This is a signal to watch for an unbounded region.

Step 2 — Find the boundary line intercepts.

  • 2x + y = 3 passes through (1.5, 0) and (0, 3).

  • x + 2y = 6 passes through (6, 0) and (0, 3).

Step 3 — Find the corner points. Solving 2x + y = 3 and x + 2y = 6 simultaneously: from the first equation, y = 3 − 2x. Substituting into the second gives x + 6 − 4x = 6, so x = 0 and y = 3 — the two lines meet at (0, 3). Checking each boundary further out, the feasible region’s edge runs along x + 2y = 6 from (0, 3) to (6, 0), after which it follows the x-axis. So the two genuine corner points are (0, 3) and (6, 0).

Step 4 — Evaluate Z at each corner point.

Corner PointZ = x + 2y
(0, 3)6
(6, 0)6

Step 5 — Verify the unbounded region. Since both (0, 3) and (6, 0) give Z = 6, check the open half-plane x + 2y < 6. It does not intersect the feasible region (which requires x + 2y ≥ 6), confirming 6 is the true minimum value, occurring at both points — and at every point on the segment joining them, proving the minimum occurs at more than one point.

A Quick-Reference Solving Checklist

Use this checklist every time you attempt a linear programming question:

  1. Underline the objective — is it “maximise,” “minimise,” or “minimise and maximise”?

  2. List every constraint separately, and note whether each uses ≤ or ≥.

  3. Find intercepts for each boundary line and plot them accurately on graph paper.

  4. Shade the correct side of each line using the origin test (or another convenient point).

  5. Mark the feasible region clearly and label every corner point with its exact coordinates.

  6. Build a results table listing each corner point and its corresponding Z value.

  7. Check boundedness. If unbounded, perform the open half-plane verification before declaring a final answer.

  8. Write a concluding sentence stating the maximum or minimum value and where it occurs.

Common Mistakes That Cost Marks

  • Skipping the verification step for unbounded regions — many students lose marks by declaring the smallest table value as the minimum without checking.

  • Mislabeling corner points — swapping x and y coordinates when reading off a graph is a frequent, avoidable error.

  • Inaccurate graphing — using an unclear scale or freehand lines instead of a ruler can lead to misidentified intersection points.

  • Assuming every line intersection is a valid corner point — always confirm it satisfies every constraint, not just the two lines that produced it.

  • Not stating the final answer in words — many students calculate the correct number but fail to write “the minimum value of Z is…” which can cost presentation marks.

How to Revise This Chapter Efficiently

Because Linear Programming is a self-contained, procedural chapter, the most effective revision strategy is repetition under time pressure rather than re-reading theory. Set a timer for 12–15 minutes per problem, work through formulation to final answer without checking the solution, and only then verify. Repeating this cycle across 8–10 varied problems builds the pattern recognition needed to solve any board-exam LPP question confidently and quickly.

Practice Full Linear Programming Problems on ChampionsPrep

Reading solved examples builds understanding, but exam-day speed comes only from solving fresh problems yourself, end to end. 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. Work through a full set of Linear Programming practice questions timed like the real exam — start your session on ChampionsPrep today.

CBSE Class 12 Linear Programming: Exercise 12.1 Solved Problems & Exam Tips podcast artwork
Audio LessonClass 12

CBSE Class 12 Linear Programming: Exercise 12.1 Solved Problems & Exam Tips

ChampionsPrep MathematicsEpisode 1288:39

Subscribe in any podcast app:

Frequently Asked Questions

How many questions does Exercise 12.1 typically contain? +

The exercise typically has around ten questions covering maximisation, minimisation, combined minimise-and-maximise problems, and a few special cases like unbounded regions or multiple optimal solutions.

What is the biggest mistake students make in Exercise 12.1 problems? +

The most common mistake is skipping the open half-plane verification step when the feasible region is unbounded, leading to an incorrect maximum or minimum claim.

How do I know if a line intersection point is a genuine corner point of the feasible region? +

Substitute the intersection point's coordinates back into every constraint of the problem; if it satisfies all of them, it is a genuine corner point, otherwise it must be discarded.

Is graph paper necessary for solving linear programming problems in exams? +

Yes, CBSE exams expect an accurately drawn graph with correctly labelled axes, boundary lines, shaded feasible region, and clearly marked corner points as part of the answer.

What is the best way to revise the Linear Programming chapter before exams? +

Practise full problems end-to-end under a timer, from formulation through to the final concluding sentence, rather than only reviewing theory, since this chapter is highly procedural.