SolveItNCERT · CBSE Boards

CBSE 2025 · Region 1 · Set 1 · Q27 · 3 marks

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} \]

Linear ProgrammingLinear Programming Problem and its Mathematical FormulationApplyshort_answermedium

More from Linear Programming

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