Class 12 Mathematics Chapter 12 Linear Programming – Revision Notes

Quick revision notes for Class 12 Maths Chapter 12 (Linear Programming). These Class 12 Mathematics Chapter 12 notes are ideal for quick revision just before exams.

Key Concepts

• Objective function: Z=ax+by (maximize/minimize).
• Constraints: linear inequalities + non-negativity (x,y≥0).
• Feasible region: common region satisfying all constraints.

Corner Point Method

• Optimal Z occurs at a vertex of the feasible region.
• Evaluate Z at each corner point; pick max/min.
• Unbounded region: check if max actually exists.
• Equal Z at two adjacent corners ⇒ entire edge is optimal (multiple solutions).

One-Line Summary

Linear Programming optimizes a linear objective function over a feasible region defined by linear constraints, with the optimum always occurring at a corner point (vertex) of the region.

Written by Satish

NCERTBooks.org is an independent educational resource run by a small team focused on making official NCERT textbooks easy to find, read, and download for students, parents, and teachers across India. We are not affiliated with NCERT or the Ministry of Education -- we organise publicly available NCERT content by class and subject, verify links against official sources, and build tools (like our in-browser reader) that make studying more convenient. Every guide we publish is written and reviewed by our team based on the actual NCERT curriculum and syllabus.