Linear Programming
NCERT Class 12 Mathematics Chapter 12
Linear Programming for Class 12 Maths: formulating a linear programming problem, constraints, the objective function, feasible regions and corner points.
1 topic Updated 7 Nov 2026
For: Class 12
In the syllabus: JEE Class 12 syllabus
With your textbook
NCERT Mathematics Part II (Class 12), Chapter 12 “Linear Programming”, reprint 2026-27.
Open the official NCERT chapter (PDF, 1.6 MB, ncert.nic.in) (opens in a new tab)
Checked on 19 Oct 2026.
Learn in this order
-
Linear programming problems and the corner point method
Linear programming (LPP) for Class 12 Maths: objective function, constraints, feasible region, corner point method, unbounded regions, solved examples.
Key formulas in this chapter
Linear programming problems
- maximise or minimise Z = ax + by subject to linear constraints, x, y ≥ 0
- optimal value at a corner point of the feasible region
- unbounded region: check ax + by > M or ax + by < m
More in Mathematics
- Sets
- Relations and Functions
- Trigonometric Functions
- Complex Numbers and Quadratic Equations
- Linear Inequalities
- Permutations and Combinations
- Binomial Theorem
- Sequences and Series
- Straight Lines
- Conic Sections
- Introduction to Three Dimensional Geometry
- Limits and Derivatives
- Statistics
- Probability
- Relations and Functions (Class 12)
- Inverse Trigonometric Functions
- Matrices
- Determinants
- Continuity and Differentiability
- Application of Derivatives
- Integrals
- Application of Integrals
- Differential Equations
- Vector Algebra
- Three Dimensional Geometry
- Probability (Class 12)