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

CBSE 2025 · Region 4 · Set 2 · Q31

Solve the following Linear Programming Problem graphically: Minimise Z =3 x +5 y subject to the constraints x +2 y ≥ 10; x + y ≥ 6; 3 x + y ≥ 8; x, y…

Solve the following Linear Programming Problem graphically : Minimise $\displaystyle \mathrm{Z}=3 \mathrm{x}+5 \mathrm{y}$ subject to the constraints \[\begin{aligned} & \mathrm{x}+2 \mathrm{y} \geq 10 \\ & \mathrm{x}+\mathrm{y} \geq 6 \\ & 3 \mathrm{x}+\mathrm{y} \geq 8 \\ & \mathrm{x}, \mathrm{y} \geq 0 \end{aligned} \]
ShareWhatsAppTelegram

More from Linear Programming

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