Maximise , subject to…

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

Problem

10. Maximise Z=x+y\mathrm{Z}=x+y, subject to x−y≤−1,−x+y≤0,x,y≥0x-y \leq-1,-x+y \leq 0, x, y \geq 0.

Related theory

Browse the problem library