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 is a method for finding the best possible value the maximum or minimum of a linear quantity, subject to a collection of linear rest…
Start this topic → 2Graphical Solution & the Corner-Point Method
An LPP in two decision variables is solved graphically , because a region in the plane can be drawn and its corners read off directly. The whole metho…
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