Chapter 12 • Class 12 Mathematics
Linear Programming
Class 12 Linear Programming — formulation, graphical method, corner point theorem, maximisation and minimisation. Solved examples and MCQ tests for CBSE and ISC.
Study by topic — one focused page each
1
Formulating a Linear Programming Problem
Linear programming finds the best (maximum or minimum) value of a linear quantity subject to linear constraints the backbone of resource-allocation pr…
Start this topic → 2Graphical Solution & the Corner-Point Method
For two variables, an LPP is solved graphically . The feasible region Plot each constraint line and shade the side satisfying its inequality. The over…
Start this topic →Chapter-wide tests
Online Test
10 MCQ • 20 min
IMO / Olympiad Practice
Olympiad level • 20 min
📝 Full Chapter Test (Download & Print)
35 marks • 75 min • with answer key