The corner points of the bounded feasible region determined by the system of linear constraints of an LPP are (0, 0), (0, 8), (5, 0) and (4, 10). Let $z = 3x - 4y$ be the objective function, then the minimum value of $z$ is:

The minimum value of the objective function $z = x + 2y$ of an L.P.P. subject to constraints $2x + y \geq 3, \frac {x} {2} + 2y \geq 6, x \geq 0, y \geq 0$ is:

The maximum value of $z = 4x + 2y$, subjected to the constraints:

$2x + 3y \le 18$, $x + y \ge 5$;

$x, y \ge 0$, is

Consider a LPP given by:

Maximize $z = 3x+4y$,

Subject to: $x+y \le 40$, $x+2y \le 60$, $x,y \ge 0$.

Then which of the following statements are correct ?

A. The corner points of the feasible region are $(0,0), (0,30), (40,0), (20,20)$.

B. The feasible region is unbounded.

C. The feasible region is bounded.

D. The maximum value of $z=3x+4y$ is obtained at $(60,40)$.

Choose the correct answer from the options given below:

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

From the below-mentioned graph of shaded feasible region of a linear programming problem (LPP) with objective function

$z = 1.50x + 1.00y$; the maximum value of $z$ will be:

The feasible region of the linear programming problem is represented below:

The constraints of this LPP are