SolveItNCERT · CBSE Boards

CBSE 2023 · Region 4 · Set 2 · Q31 · 3 marks

Solve the following linear programming problem graphically : Maximise $\displaystyle \mathrm{z}=-3 \mathrm{x}-5 \mathrm{y}$ subject to the constraints \[\begin{array}{r} -2 \mathrm{x}+\mathrm{y} \leq 4 \\ \mathrm{x}+\mathrm{y} \geq 3 \\ \mathrm{x}-2 \mathrm{y} \leq 2 \\ \mathrm{x} \geq 0, \mathrm{y} \geq 0 \end{array} \]

Linear ProgrammingLinear Programming Problem and its Mathematical FormulationApplyshort_answermedium

More from Linear Programming

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