Corner points of the feasible region determined by the system of linear constraints are $(0,3),(1,1)$ and $(3,0)$. Let $Z=p x+q y$, where $p, q>0$. Condition on $p$ and $q$, so that the minimum of $Z$ occurs at $(3,0)$ and $(1,1)$ is
In a LPP, the linear inequalities or restrictions on the variables are called ....... .
In a LPP, the linear inequalities or restrictions on the variables are called linear constraints.
In a LPP, the objective function is always... .
In a LPP, objective function is always linear.
In the feasible region for a LPP is ......, then the optimal value of the objective function $Z=a x+b y$ may or may not exist.
If the feasible region for a LPP is unbounded, then the optimal value of the objective function $Z=a x+$ by may or may not exist.
In a LPP, if the objective function $Z=a x+b y$ has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same ........ value.
In a LPP, if the objective function $Z=a x+$ by has the same maximum value on two corner points of the feasible region, then every point on the line segment joining these two points give the same maximum value.