The feasible region for an LPP is shown below. Let $Z = 3x - 4y$ be the objective function. Maximum of Z occurs at :

Two linear programming problems (LPPs) have same bounded feasible region with three corner points $(0, 3), (4, 4), (7, 0)$. If $Z_1 = x - 3y$ and $Z_2 = 2x + y$ are objective functions of LPPs, then which of the following is/are correct?

A. only $Z_1$ maximizes at $(7, 0)$.

B. both $Z_1, Z_2$ minimize at $(0, 3)$.

C. both $Z_1, Z_2$ maximize at $(7, 0)$.

D. $Z_2$ maximizes at $(4, 4)$.

Choose the correct answer from the options given below:

The solution of LPP

max.(z) = $5x + 3y$ subject to

$2x + y \leq 6$

$x + y \leq 4$

$x \geq 0, y \geq 0$, is

Consider a LPP with objective function $Z = px + qy$ subjected to certain constraints with a bounded feasible region such that maximum $Z = 80$ and minimum $Z = 52$, which occur at the corner points $(0, 8)$ and $(2, 4)$ respectively, Then the value of $p+q$ is:

The number of corner points of the feasible region determined by the constraints $2x - y \geq 0, x - 3y + 3 \geq 0, x \geq 0, y \geq 0$ is

A feasible solution is :

The corner points of the feasible region for an L.P.P. are $(0, 10)$, $(5, 5)$, $(5, 15)$ and $(0, 30)$. If the objective function is $Z = \alpha x + \beta y$, where $\alpha, \beta > 0$, find the condition on $\alpha$ and $\beta$ so that the maximum of $Z$ occurs at both the corner points $(5, 15)$ and $(0, 30)$.