A manufacturer produces two products, A and B. Both products are processed on two different machines. The available capacity of the first machine is 12 hours and of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at ₹7 profit and that of product B at a profit of ₹4. A LPP to maximise the profit is:

The corner points of the bounded feasible region for an LPP are $(0,5), (6,6), (9,9)$ and $(0,12)$. If the objective function is $Z = px + qy; p,q>0$, then the condition on $p$ and $q$ so that the maximum of $Z$ occurs at $(9,9)$ and $(0,12)$ is

The corner points of the feasible region determined by inequalities of LPP are $(4, 10)$, $(6, 8)$ and $(6, 5)$. Let $z = 3x + 4y$ be the objective function. Then the sum of maximum value of z and minimum value of z is :

Match List - I with List - II.

Choose the correct answer from the options given below :

The minimum value of $Z = 2x + y$ subjected to $x + y \geq 10, 2x + 3y \leq 26, x, y \geq 0$ is

The feasible solution to the LPP is-

For a two variables linear programming problem (LPP), which of the following statement is correct ?