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 the bounded feasible region for an LPP are (0, 0), (6, 0), (4, 3) and (0, 8). The objective function $Z=px+qy$, $p,q>0$ has maximum value 360 at points (6, 0) and (4, 3). The value of $Z$ at (0, 8) is :

A furniture trader deals in only two items - chairs and tables. He has Rs. 50,000 to invest and a space to store almost 35 items. A chair costs him Rs. 1000 and a table costs him Rs. 2000. The trader earns a profit of Rs. 150 and Rs. 250 on a chair and a table, respectively. Choose the correct option among following that describes the given linear programming problem (LPP) to maximize the profit ( where x and y are the number of chairs and tables that trader buys and sells)?

Match List-I with List-II

Choose the correct answer from the options given below:

The corner points of the feasible region of a LPP with the constraints $x + 2y \leq 40$, $3x + y \geq 30$, $4x + 3y \geq 60$, $x, y \geq 0$ are

A company makes two types of cakes: type A and type B. it costs ₹ 360 to make a type A cake and ₹ 120 to make a type B cake. The company can make atmost 300 cakes and spend atmost ₹ 72,000 a day, the number of cakes of type B ($y$) cannot exceed the number of type A ($x$) cakes by more than 200.

The company makes a profit of ₹ 200 on each type A cake and ₹ 50 on each type B cake. A LPP to maximize the profit (₹) is

Which of the following is incorrect about the Linear Programming Problem (LPP)?