CBSE Class 12 Mathematics 2026 Main Paper 65/5/1 · Q201 Marksalternative_optima

CBSE Class 12 Mathematics 2026 Main Paper 65/5/1 · Question 20 (Linear Programming)

Assertion: Minimizing Z=x+2y with 2x+y≥3, x+2y≥6, x,y≥0 has infinitely many minimizers, and the corners are (0,3) and (6,0). Reason: If two feasible corners attain the minimum, their whole joining segment does.

(A) Both true, and the reason explains the assertion.
(B) Both true, but the reason does not explain the assertion.
(C) Assertion true, reason false.
(D) Assertion false, reason true.

✅ Step-by-Step Solution

Final Answer: Both true, and the reason explains the assertion.

In the first quadrant x+2y≥6 implies 2x+y≥3. The boundary segment joins the two stated corners and the linear objective is 6 throughout it.

Master Chapter 12: Linear Programming

Practise interactive questions, flashcards, visual mind maps, and timed board tests for Linear Programming.

📘 Chapter Notes & All Exercises 🚀 Open in Interactive Workspace →

← Previous Question

Assertion: R={(1,1),(1,2),(2,1),(2,2),(3,3)} is an equivalence…

Next Question →

Evaluate \(\sin[\tan^{-1}(\tan(3\pi/4))]\).

All Questions in CBSE Class 12 Mathematics 2026 Main Paper 65/5/1

Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24 Q25 Q26 Q27 Q28 Q29 Q30 Q31 Q32 Q33 Q34 Q35 Q36 Q37 Q38

CBSE Class 12 Mathematics 2026 Main Paper 65/5/1 · Question 20 (Linear Programming)

✅ Step-by-Step Solution

Master Chapter 12: Linear Programming

All Questions in CBSE Class 12 Mathematics 2026 Main Paper 65/5/1

Related Questions in Linear Programming