Linear Programming: Class 12 Mathematics (CBSE) important questions and practice
Linear Programming is chapter 12 of 13 in CBSE Class 12 Mathematics. Below are the topics the paper draws from, the question types that come up again and again, and a free practice test on this chapter alone.
Topics in this chapter
- Linear programming problem: objective function, constraints, non-negative restrictions
- Graphical method of solution: feasible region, corner points
- Bounded and unbounded feasible regions
- Optimal solution, multiple optimal solutions and infeasibility
- Reading an LPP from a graph or a word problem
What examiners usually ask
- Solve graphically: maximise Z = 3x + 4y subject to x + y <= 4, x >= 0, y >= 0
- Minimise Z = 200x + 500y subject to x + 2y >= 10, 3x + 4y <= 24, x, y >= 0 by the graphical method
- The feasible region of an LPP is shown in the figure; find the corner points and the maximum value of Z = 5x + 7y
Exam tip
Draw the lines with intercepts, shade the feasible region, list every corner point in a table with the value of Z and state the answer; for an unbounded region check the open half-plane of Z > M (or Z < m) before declaring a maximum or minimum.
Linear Programming on other boards and exams
Frequently asked questions
What are the important questions from Linear Programming for CBSE Class 12?
The question types listed above repeat most often in CBSE Class 12 Mathematics papers for this chapter. Practise them with the chapter test and then attempt them inside a full previous-year paper under time.
Is Linear Programming in the CBSE Class 12 Mathematics syllabus?
Yes. Linear Programming is part of the current CBSE Class 12 Mathematics syllabus, as listed on this site from the prescribed textbook.
Can I practise Linear Programming MCQs in Hindi?
Yes. The chapter test and explanations are available in Hindi and English, with an AI doubt solver for any question.