SolveIt is under development
SolveItNCERT · CBSE · NEET
Question 12 / 91 · latest first
✓ Board-verified
Mathematics · 2026 · 3 marks

CBSE 2026 · Region 4 · Set 2 · Q29

Solve the following Linear Programming Problem graphically: Minimize Z =20 x +10 y subject to x +2 y ≤ 40; 3 x + y ≥ 30; 4 x +3 y ≥ 60; x, y ≥ 0

Solve the following Linear Programming Problem graphically : Minimize $\displaystyle \mathrm{Z}=20 \mathrm{x}+10 \mathrm{y}$ subject to \[\begin{array}{r} \mathrm{x}+2 \mathrm{y} \leq 40 \\ 3 \mathrm{x}+\mathrm{y} \geq 30 \\ 4 \mathrm{x}+3 \mathrm{y} \geq 60 \\ \mathrm{x}, \mathrm{y} \geq 0 \end{array} \]
ShareWhatsAppTelegram

More from Linear Programming

CBSE Class 12 Mathematics past-paper question from the 2026 board exam, with the answer as CBSE’s own marking scheme gives it. Where our answers come from.