The corner points of the feasible region associated with the LPP: Maximise $Z = px + qy$, $p,q > 0$ subject to $2x + y \leq 10$, $x + 3y \leq 15$, $x, y \geq 0$ are (0, 0), (5, 0), (3, 4) and (0, 5). If optimum value occurs at both (3, 4) and (0, 5), then

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

For the graph of a linear programming problem(LPP) given below. If $\min z = 3x+5y$ is the objective function and shaded portion in the figure is the feasible region of the LPP, then constraints other than $x, y \geq 0$ are

The point at which the maximum value of the function $Z=x+y$, subject to the constraints $x+2y\leq70$, $2x+y\leq95$, $x,y\geq0$, is obtained, is:

If the objective function for a linear programming problem (LPP) is $Z = 4x + 5y$ and the corner points of the bounded feasible region are (9, 0), (4, 3), (2, 5), and (0,8), then the minimum value of Z is:

The feasible solution to the LPP is-

Consider the following L.L.P.

Minimize z = 30x - 30y + 1800;

subject to x + y ≤ 30, x ≤ 15, y ≤ 20, x + y ≥ 15 and x, y ≥ 0.

Then it attains its optimal value at the point