🧮
Class 12 Mathematics — Chapter 12: Linear Programming
66 practice questions · 22 Easy · 22 Medium · 22 Hard
Free NCERT-aligned multiple-choice practice for Class 12 Mathematics, Chapter 12 (Linear Programming). Practise timed Easy, Medium and Hard quizzes with instant explanations — built for CBSE Board exams, JEE Main and NEET UG. Here are a few sample questions; sign in free to practise all 66.
Sample questions
Q1Easy
In LPP, the function to optimise is called:
A.Objective function✓ correct
B.Constraint
C.Variable
D.Boundary
Why
Maximise/minimise.
Q2Medium
Feasible region is the:
A.Set of points satisfying all constraints✓ correct
B.Origin
C.Single point
D.Whole plane
Why
Intersection of half-planes.
Q3Hard
If feasible region is unbounded, optimum may:
A.Not exist (problem may be unbounded)✓ correct
B.Always exist
C.Be zero
D.Be infinity always
Why
Need to verify with check.
Practise all 66 questions free
Timed quizzes, instant scoring, streaks and XP. Sign in with Google — no card needed.
Start this chapter free →