The corner points of the bounded feasible region for an LLP are: (5, 5), (15, 15), (0, 20) and (0, 10). Let $z = 3x + 9y$ be the objective function. Then the value of $maximum(z) - minimum(z)$ is

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

The constraints of this LPP are

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

The feasible region corresponding to the linear constraints of a Linear Programming Problem (LPP) is represented by the shaded region in the given figure. Which of the following is not a constraint to the given LPP?

If the corner points of the bounded feasible region of a Linear Programming Problem are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5), then the minimum value of the objective function $z = 2x+3y$ occurs at

The solution of a LPP with basic feasible solutions (0, 0), (10, 0), (0, 20), (10, 15) and objective function Max $Z = 2x + 3y$ is :

Max (z) = 5x + 10y subject to constraints:

$x + 2y < 120$

$x + y > 60$

$x - 2y > 0$

$x, y \geq 0$

Which of the following points do not lie in the feasible region of the above LPP ?

(A) (90, 15)

(B) (30, 15)

(C) (60, 20)

(D) (90, 10)

Choose the correct answer from the options given below: