The corner points of the bounded feasible region for an LPP are (0, 20), (3,12), (6,8), and (0,15). The objective function is $Z = \alpha x + \beta y$, where $\alpha, \beta > 0$. If the maximum of Z occurs at the corner points (3,12) and (6,8), then the relationship between $\alpha$ and $\beta$ is:

If the optimal value of the objective function $z = px + y$ of an L.P.P occurs at two corner points (2, 11) and (4, 5) of its bounded feasible region, then its optimal value is

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

A LPP $max\,z = ax+by$ having bounded feasible region with vertices on $(2,1), (3,2), (5,6)$ and $(1,7)$. Then which of following are TRUE?

A. $max\,z$ occurs at $(1,7)$ and $(5,6)$ if $b = 4a$

B. $max\,z$ occurs at $(1,7)$ and $(5,6)$ if $b = -4a$

C. $max\,z$ does not exist

D. if $max\,z$ occurs at $(1,7)$ and $(5,6)$, then $max\,z$ occurs for infinite number of value of $x$ and $y$

Choose the correct answer from the options given below:

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

While solving an LPP, the corner points of a bounded feasible region were found to be (0,0), (1, 9), (3, 7), (4, 5.5) and (10, 0). The objective function $Z = 4x + y$ will maximise at:

For a linear programming problem, the maximum value of the objective function $z=2x+3y$ subject to constraints:

$x-y\le-1, -x+y\le0, x,y\ge0$ is