⚡ 10,279 VERIFIED QUESTIONS 333 AUTHENTIC BOARD PAPERS CBSE Board Revision Archive 100% FREE PUBLIC REVISION 37 NCERT CHAPTERS 3,054 PARALLEL SET CLONES ⚡ 10,279 VERIFIED QUESTIONS 333 AUTHENTIC BOARD PAPERS CBSE Board Revision Archive 100% FREE PUBLIC REVISION 37 NCERT CHAPTERS 3,054 PARALLEL SET CLONES
HOME CBSE 12 MATHEMATICS LINEAR PROGRAMMING
✓ 1 MARKS MCQ
🔥 APPEARED IN 3 BOARD SETS
The corner points of the feasible region determined by the system of linear constraints are $(0, 0), (0, 40), (20, 40) (60, 20)$ and $(60, 0)$. If the objective function of an LPP is $Z = 4x + 3y$, then the maximum value is :
A
200
B
300
C
240
D
120
YearPaper CodeSetPosition
CBSE 2026Series 65-5Set 1Question 15
CBSE 2026Series 65-5Set 2Question 16
CBSE 2026Series 65-5Set 3Question 14
  • Step 1: Stating the fundamental formula / law statement (+1 Mark)
  • Step 2: Intermediate mathematical substitution or proof steps (+1 Mark)
  • Step 3: Correct final value or conclusion with mandatory SI units (+1 Mark)
🎯 PRACTICE ALL QUESTIONS FROM LINEAR PROGRAMMING IN HUB ➔