Chapter 12 of Class 12 Maths is Linear Programming. It covers formulating real-world optimization problems as linear programming problems (LPPs) and solving them graphically. These Class 12 Mathematics Chapter 12 solutions are also useful as quick revision notes before exams.
Linear Programming Problem (LPP)
An LPP involves optimizing (maximizing or minimizing) a linear objective function Z=ax+by, subject to a set of linear constraints (inequalities) and non-negativity restrictions (x≥0, y≥0).
Feasible Region
The feasible region is the common region satisfying all constraints simultaneously, represented graphically. It is bounded if enclosed within a finite area, or unbounded otherwise. Points within/on the boundary are feasible solutions.
Corner Point Method
The optimal value of Z (if it exists) occurs at a corner point (vertex) of the feasible region. Method: identify all corner points, evaluate Z at each, and select the maximum/minimum value.
Types of LPP
Common real-world applications: diet problems (minimize cost subject to nutritional constraints), manufacturing problems (maximize profit subject to resource constraints), transportation problems (minimize transportation cost).
Special Cases
If the feasible region is unbounded, a maximum may not exist even if Z appears large at corner points — must verify by checking if the constraint half-plane intersects the region. Multiple optimal solutions occur when Z is constant along an entire edge of the feasible region.
- Chapter 1: Relations and Functions – Free PDF Download
- Chapter 2: Inverse Trigonometric Functions – Free PDF Download
- Chapter 3: Matrices – Free PDF Download
- Chapter 4: Determinants – Free PDF Download
- Chapter 5: Continuity and Differentiability – Free PDF Download
- Chapter 6: Applications of Derivatives – Free PDF Download
- Chapter 7: Integrals – Free PDF Download
- Chapter 8: Applications of Integrals – Free PDF Download
- Chapter 9: Differential Equations – Free PDF Download
- Chapter 10: Vectors – Free PDF Download
- Chapter 11: Three-Dimensional Geometry – Free PDF Download
- Chapter 13: Probability – Free PDF Download
Frequently Asked Questions
What is the corner point method?
Evaluating the objective function at each vertex of the feasible region to find the optimal value.
What is a feasible region?
The region satisfying all the given linear constraints simultaneously.
Can an unbounded feasible region have a maximum?
Not always — it depends on whether the corresponding half-plane of Z=constant intersects the feasible region for large values.
Class 12 Mathematics Chapter 12 – Notes and Extra Questions
Along with these NCERT Solutions, students can also use the Class 12 Mathematics Chapter 12 Extra Questions and Class 12 Mathematics Chapter 12 Revision Notes for quick revision and extra practice.
See also: Chapter 1 | Chapter 2 | Chapter 3 | Chapter 4 | Chapter 5 | Chapter 6 | Chapter 7 | Chapter 8 | Chapter 9 | Chapter 10 | Chapter 11
Practice more: Chapter 1 | Chapter 2 | Chapter 3 | Chapter 4 | Chapter 5 | Chapter 6 | Chapter 7 | Chapter 8 | Chapter 9 | Chapter 10 | Chapter 11
Quick revision: Chapter 1 | Chapter 2 | Chapter 3 | Chapter 4 | Chapter 5 | Chapter 6 | Chapter 7 | Chapter 8 | Chapter 9 | Chapter 10 | Chapter 11

