The corner points of the bounded feasible region determined by the system of linear constraints are (0, 0), (0, 9), (2, 10), (6, 8), (10, 0). If the objective function is $Z=6x+5y$, then (Maximum value of $Z$ – Minimum value of $Z$) is equal to:

If the objective function for an L.P.P is $Z=2x+5y$ and the corner points for bounded feasible region are (8, 0), (2, 3), (3, 5), and (0, 7), then the minimum value of $Z$ occurs at

The linear constraints for which the shaded region in the figure are:

The feasible region represented by the constraints $x + y \leq 50, 3x + y \leq 90, x \geq 0, y \geq 0$ of an LPP is

The corner points of the bounded feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let z = px + qy where p, q > 0. Then the condition on p and q so that the maximum value of z occurs at (15, 15) and (0, 20) is

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

Consider the linear programming problem (LPP):

Max Z= 4x + 3y

subject to the constraints:

$x\le 8, y\le 4, x\ge 0, y\ge 0$. At what coordinates will the objective function have optimal solution?