The constraints of the given shaded feasible region below of an L.P.P., for non-negative variable constraints $x$ and $y$ are <img src="https://balti.afterboards.in/IECuq9aGxsHDLdW" width="300px"/>

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

Consider a LPP with objective function $z = ax + by$. If its feasible region R is bounded, then $z$

Consider an LPP:

Maximise $Z = 15x + 10y$

Subject to $2x + y \le 40$

$2x + 3y \le 80$

$x, y \ge 0$

Which of the following are correct?

A. The feasible region is bounded.

B. The corner points of the feasible region are $(0,0), (40,0), (10,20)$ and $(0,40)$.

C. The corner points of the feasible region are $(0,0), (20,0), (10,20)$ and $\left(0, \dfrac{80}{3}\right)$.

D. The maximum value of Z is 350.

Choose the correct answer from the options given below:

The region represented by the constraints $x \geq 0, y \geq 0$ of an LPP 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

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