Maximise , subject to the constraints:…

MATHEMATICS · Subjective · CBSE · Mathematics · Linear Programming · Linear Programming

Problem

9. Maximise Z=−x+2y\mathrm{Z}=-x+2 y, subject to the constraints: x≥3,x+y≥5,x+2y≥6,y≥0x \geq 3, x+y \geq 5, x+2 y \geq 6, y \geq 0.

Related theory

Browse the problem library