If $z = 5x + 8y$ is the objective function of a LPP and (0, 0), (3, 1), (2, 4), (0, 3), (5, 0) are corner points of the bounded feasible region, then the maximum value of the objective function is

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

For linear programming problem maximize $z=2x+3y$

Subject to the constraints $x+y \leq 4$

$x \leq 2$

$x \geq 0, y \geq 0$

Maximum value of z is

An objective function $Z=a x+b y$ is maximum at points $(8,2)$ and $(4,6)$. If $a \geq 0$ and $b \geq 0$ and $a b=25$, then the maximum value of the function is equal to :

Let the corner points of the bounded feasible region of an LPP determined by a set of constraints are A(1, 5), B(3, 2) and C(2, 1). If the objective function $z=2ax+by$, $a,b>0$ has maximum values at points A and B, and z has minimum value 8 at point C, then the value of $4a+b$ is:

The linear constraints for which the shaded region in the figure are:

The programming problem

Max $Z = 2x + 3y$ subject to the conditions $0 \leq x \leq 3, 0 \leq y \leq 4$ is :