For the linear programing problem, $Minimize(Z) = 60x + 30y$ subject to: $2x - y \geq -5; 3x + y \geq 3; 2x - 3y \leq 12; x, y \geq 0$ the optimal value of $z$ is

Which one of the following set of constraints does the given shaded region represent?

For the linear programming problem:

Minimize $z = 2x - 5y$, subject to the constraints:

$x + 2y \ge 10$;

$3x + 4y \le 24$;

$x,y \ge 0$, then optimal value of $z$ is

The maximum value of $z = 3x + 4y$ subject to the constraints

$x + y \geq 2, 2x + 3y \leq 6, x \geq 0, y \geq 0$ is

For a LPP, the objective function is $z=4x+3y$ and the feasible region determined by a set of linear constraints is shown in the graph as a shaded portion. Which one of the following statement is true ?

The corner points of the bounded feasible region determined by a set of constraints in an LPP are $P(0, 5)$, $Q(3, 5)$, $R(5, 0)$ and $S(4, 1)$. If the objective function is $z = ax + 2by$, where, $a, b > 0$, then the condition on $a$ and $b$ such that the maximum value of $z$ occurs at $Q$ and $S$ is

If the objective function for a linear programming problem (LPP) is $Z = 4x + 5y$ and the corner points of the bounded feasible region are (9, 0), (4, 3), (2, 5), and (0,8), then the minimum value of Z is: