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 above Linear Programming Problem [LPP] is given by

The maximum value of $Z = 3x+2y$ subject to the constraints $x+2y \geq 8$, $x+y \leq 10, x \geq 0, y \geq 0$ is

In a linear programming problem, the corner points of the feasible region, determined by the system of linear inequalities are (0, 0), (5, 0), (3, 4) and (0, 5). Let $z=5x+qy, q>0$ be the objective function. For what value of q the maximum value of z occurs at both (3, 4) and (0, 5)?

Let the corner points of the bounded feasible region of the linear programming problem (LPP) $Z = ax+by$ be: (0, 0), (2, 0), (20/19, 45/19) and (0, 3). If the optimal value of Z occurs at both points (2, 0) and (20/19, 45/19), then the relation between a and b is:

For LPP: Maximize $z = 2x + 3y$ subject to the constraints

$x + y \geq 2$, $x + 2y \geq 3$, $x \geq 0$, $y \geq 0$,

which of the following graph represents the feasible region of the above LPP as shaded portion?

The corner points of feasible region are:

A. (0, 240)

B. (0, 0)

C. (300, 0)

D. (120, 180)

E. (180, 120)

Choose the correct answer from the options given below:

If $z = 3x + 4y$ be the objective function of a of a linear programming problem (LPP) and (3, 1), (2, 4), (0, 4), (5, 0) be corner points of the bounded feasible region. Then the maximum value of objective function is