CBSE Math Revision
Knowledge organisers

Linear Programming: CBSE Class 12 Maths knowledge organiser

Linear Programming for CBSE Class 12 Maths, on one page.

Download the A4 sheet (PDF)

Key definitions

Objective function
The linear function Z=ax+by to be maximised or minimised.
Constraints
The linear inequalities the variables must satisfy.
Feasible region
The region where all the constraints hold; the optimum is at a corner point.

Key formulas

Maximise/minimise Z=ax+by subject to linear constraints, x,y≥0
Corner point method: the optimum occurs at a corner of the feasible region. Bounded region: both max and min exist
Unbounded: M is the max only if ax+by>M has no point in the feasible region (use <m for the min)

Worked example

Maximise Z=2x+5y with x+y≤5, y≤3, x,y≥0: corners (0,0),(5,0),(2,3),(0,3), Z=0,10,19,15; maximum 19 at (2,3).

Common mistakes

  • Missing a corner (e.g. where a constraint meets an axis) or including an intersection point that violates another constraint.
  • Declaring a maximum/minimum on an unbounded region without the half-plane check.
  • Shading the wrong side of a line, always test a point.
  • Forgetting the non-negativity constraints, or units and the final interpretation in word problems.

You should be able to…

  • Use LP vocabulary, test points against constraints, formulate a simple LPP and read optimal values from given corner points.
  • Draw feasible regions, find corner points algebraically and solve bounded and unbounded problems, including the half-plane check.
  • Write full-mark 5-mark LPP answers from a word problem: formulation, labelled graph, corner-point table and conclusion.
  • Handle parameters in the objective function, multiple optimal solutions and existence questions for unbounded regions.

Linear Programming in CBSE Class 12

Linear Programming is Chapter 12 of the Class 12 course, in the Linear Programming unit. The unit carries 5 of the 80 theory marks (CBSE gives marks by unit, not by chapter). We plan about 6 hours to master it.

Our Class 12 notes on it are in 3 parts: Terminology and formulation; Feasible region and corner points; Corner-point method. This sheet keeps the essentials of each on one page; the notes have the reasoning, three worked examples and the board-exam tips.

When the sheet is learnt, practise: the chapter page has 49 board-style questions with step marks. By sub-topic: Graphical solution: bounded region (13), Graphical solution: unbounded region (12), Special cases: multiple optima and infeasibility (8), Feasible region and corner points (8) and Terminology and formulation (8). By CBSE question type: 14 multiple choice (1 mark each), 3 assertion-reason (1 mark each), 10 very short answer (2 marks each), 14 short answer (3 marks each), 3 case study (4 marks each) and 5 long answer (5 marks each). Route to 95 takes you through them in 4 steps: Secure the basics, 6 questions; Board standard, 20 questions; Full marks on long answers, 5 questions; 95+ stretch (HOTS), 6 questions.

Try it now

1 of 5

  1. Question 1 of 5
  2. Question 2 of 5
  3. Question 3 of 5
  4. Question 4 of 5
  5. Question 5 of 5

5 quick questions on linear programming. No sign-in needed.

The corner points of the feasible region of an LPP are (0,2), (3,0), (6,0), (6,8) and (0,5). The minimum value of Z=4x+6y is

Choose your answer · keys 1–4

The printable sheet

Linear Programming knowledge organiser for CBSE Class 12 Maths: one A4 page of key definitions, formulas, a worked example and common mistakes
Linear Programming knowledge organiser (CBSE Class 12 Maths), A4. Download the PDF.

Revise it next

Other CBSE Class 12 Maths topics: Relations and Functions · Inverse Trigonometric Functions · Matrices · Determinants · Continuity and Differentiability · Application of Derivatives · Integrals · Application of Integrals · Differential Equations · Vector Algebra · Three Dimensional Geometry · Probability · All CBSE Class 12 Maths organisers