Solve the following linear programming problem graphically and interpret your result of Z = 2x - 5y…
Solve the following linear programming problem graphically and interpret your result of $Z = 2x - 5y$ subject to the constraints $x + y \ge 2$, $x - y \ge 0$, $x \le 1$, $x \ge 0$, $y \ge 0$.
Maximise or minimise $Z = 2x - 5y$ subject to $x + y \ge 2$, $x - y \ge 0$, $x \le 1$, $x, y \ge 0$.
From $x - y \ge 0$ and $x \le 1$: $y \le x \le 1$, so $x + y \le 2$.
With $x + y \ge 2$ this forces $x + y = 2$, $x = 1$ and $y = 1$.
On the graph the regions of the constraints meet at the single point $(1, 1)$, so the feasible region is this one point.
At $(1, 1)$: $Z = 2(1) - 5(1) = -3$.
Hence $Z$ has the value $-3$ at $(1, 1)$; as it is the only feasible point, this is both the maximum and the minimum.