Solve the following linear programming problem graphically: Maximise z =-3 x -5 y subject to the constraints -2 x + y ≤ 4; x + y ≥ 3; x -2 y ≤ 2; x ≥…

Corner Points	Value of Z
$\displaystyle A(0,4)$	-$\displaystyle 20$
$\displaystyle D(0,3)$	-$\displaystyle 15$
$\displaystyle G(8 / 3,1 / 3)$	$\displaystyle -29 / 3 \rightarrow$ Max

Since feasible region is unbounded and $\displaystyle -\frac{\mathbf{2 9}}{\mathbf{3}}$ is the maximum value of z at corner $\displaystyle \left(\frac{\mathbf{8}}{\mathbf{3}}, \frac{\mathbf{1}}{\mathbf{3}}\right)$. So, we consider the open half plane $\displaystyle -3 \mathrm{x}-5 \mathrm{y}>-\frac{\mathbf{2 9}}{\mathbf{3}}$, which