The linear constraints for which the shaded region in the figure is the solution set, are

Consider the following L.P.P minimize $z = x - 7y + 190$ subject to $x + y \le 8, x + y \ge 4, x \le 5, y \le 5$ and $x, y \ge 0$. Then which of the following is/are true?

(A) It's feasible region is unbounded

(B) It's feasible region is bounded

(C) It's feasible region has 5 corner points

(D) It's feasible region has 6 corner points

Choose the correct answer from the options given below:

A manufacturing company makes two models M$_1$ and M$_2$ of a product. Each piece of M$_1$ requires 9 labour hours for fabricating and one labour hour for finishing. Each piece of M$_2$ require 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of Rs.800 on each piece of M$_1$ and Rs.1200 on each piece of M$_2$

The maximum profit will be at the point

Consider the following L.P.P

Max. z = 5x + 2y; subject to -2x - 3y ≤ -6, x - 2y ≤ 2, 3x + 2y ≤ 12, -3x + 2y ≤ 3 and x, y ≥ 0 then

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 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:

If corner points of the bounded feasible region of a linear programming problem are as in the figure given below and $z = px + qy$, $(p,q > 0)$ is an objective function. Then the relation between $p$ and $q$, when $z$ is maximum at $D(4,10)$ and $C(6,8)$, is: