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

CBSE 2025 · Region 1 · Set 1 · Q27

Solve the following linear programming problem graphically: Maximise Z= x +2 y Subject to the constraints: x - y ≥ 0; x -2 y ≥-2; x ≥ 0, y ≥ 0

Solve the following linear programming problem graphically : Maximise $\displaystyle Z=\mathrm{x}+2 \mathrm{y}$ Subject to the constraints : \[\begin{aligned} & \mathrm{x}-\mathrm{y} \geq 0 \\ & \mathrm{x}-2 \mathrm{y} \geq-2 \\ & \mathrm{x} \geq 0, \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.