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

CBSE 2023 · Region 3 · Set 3 · Q31

Solve the following linear programming problem graphically: Minimize z = x +2 y subject to the constraints 2 x + y ≥ 3; x +2 y ≥ 6; x ≥ 0; y ≥ 0

Solve the following linear programming problem graphically : Minimize $\displaystyle \mathrm{z}=\mathrm{x}+2 \mathrm{y}$ subject to the constraints \[\begin{aligned} 2 \mathrm{x}+\mathrm{y} & \geq 3 \\ \mathrm{x}+2 \mathrm{y} & \geq 6 \\ \mathrm{x} & \geq 0 \\ \mathrm{y} & \geq 0 \end{aligned} \]
ShareWhatsAppTelegram

More from Linear Programming

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