The vertices of a closed convex polygon representing the feasible region of the LPP with, objective function $z = 5x + 3y$ are $(0, 0)$, $(3, 1)$, $(1, 3)$ and $(0, 2)$. The maximum value of $z$ is

If the objective function for an L.P.P is $Z=2x+5y$ and the corner points for bounded feasible region are (8, 0), (2, 3), (3, 5), and (0, 7), then the minimum value of $Z$ occurs at

For the L.P.P. Maximize z = 10x + 6y subjected to

3x + y ≤ 12,

2x + 5y ≤ 34,

x, y ≥ 0.

Then the feasible region represented by system of inequalities is

The solution of LPP

max.(z) = $5x + 3y$ subject to

$2x + y \leq 6$

$x + y \leq 4$

$x \geq 0, y \geq 0$, is

If the corner points of the bounded feasible region for a Linear Programming Problem (LPP) are A(0,2), B(3, 0), C(2, 3) and D(3, 1), then the maximum value of the objective function $Z = 4x + 2y$ occurs at

Which one of the region I, II, III, IV is represented by the constraints

$x + 3y \le 60, x + y \ge 10, x \le y, x \ge 0, y \ge 0$

Consider an LPP: Maximise $Z = 50x + 15y$ subjected to constraints

$x + y \leq 60$,

$5x + y \leq 100$,

$x, y \geq 0$.

If the maximum value of $Z$ occurs at $x = \alpha$ and $y = \beta$, then the value of $\alpha + \beta$ is