Let $Z=ux+vy$, $u,v>0$ be the objective function of a linear programming problem. Then the condition on $u$ and $v$ so that the maximum of $Z$ occurs at both points $(3,4)$ and $(0,5)$ is :

If a, b, c > 0 and $ax+by>c$, then its graph represents:

For the L.P.P. Maximize z = 10x + 6y subjected to

3x + y ≤ 12,

2x + 5y ≤ 34,

x, y ≥ 0.

Then the feasible region represented by system of inequalities is

A LPP $max\,Z = 3x + 8y$ subjected to the constraints $2x + y \le 10$, $x + 3y \le 15$, $x,y \ge 0$, then $max\,Z$ is

Which one of the following set of constraints represents the shaded region given below?

The feasible region of a LPP is bounded. The corresponding objective function is Z= 6x - 7y. Then objective function attains:

If the objective function for an LPP is $Z=4x+5y$ and the corner points for bounded feasible region are (10, 0), (5, 3), (2, 5) and (0, 6), then the minimum value of $Z$ occurs at