Consider the LPP: Minimize $Z = x + 2y$ subject to $2x + y \geq 3$, $x + 2y \geq 6$, $x, y \geq 0$. The optimal feasible solution occurs at

The corner points of the feasible region of the LPP: Minimize $Z = -50x + 20y$ subject to $2x - y \geq -5$, $3x + y \geq 3$, $2x - 3y \leq 12$ and $x, y \geq 0$ are

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

The corner points of a bounded feasible region determined by the following system of linear inequalities $x + 3y \leq 60, x + y \geq 10$, $x \leq y$, $x \geq 0$, $y \geq 0$ are (0,10), (5,5), (15, 15) and (0, 20). Let $z = 2px + qy$, $p, q > 0$. If maximum of z occurs at both (15, 15) and (0, 20), then the relation between p and q is

The maximum value of $z$ for the linear programing problem maximize $z = x + y$ subject to the constraints $x + 4y \leq 8, 2x + 3y \leq 12, 3x + y \leq 9, x \geq 0, y \geq 0$ is:

The maximum value of $z = 5x + 7y$ subjected to constraints $x + y \leq 5$, $x \geq 0$, $y \geq 0$ is:

The point/points which provides the optimal solution of the linear programming problem maximum $z = 3x+y$, $x+3y \le 12, 3x+y \le 12, x,y \ge 0$, is/are