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 feasible region for an LPP is shown by shaded region in the figure. Then the minimum value of Z = 11x + 7y is

The corner points of the bounded feasible region associated with the LPP: Maximize $Z=px+qy$, $p,q>0$ are $(0, 0)$, $(3.5, 0)$, $\left(\frac{112}{59}, \frac{135}{59}\right)$ and $(0, 3)$. If the optimum value of Z occurs at both $\left(\frac{112}{59}, \frac{135}{59}\right)$ and $(0, 3)$, then

The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is $z = 4x + 3y$.

Compare the quantity in Column - A and Column - B.

The feasible region determined by the following constraints of a LPP

$x+y \ge 5$

$y \le 8$

$x \ge 0, y \ge 0$ is

The maximum value of the objective function $Z = 2x + y$ of an LPP, subject to the constraints $x \leq 6, y \leq 2, x - y \leq 0$, $x \geq 0, y \geq 0$ is

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