Consider the linear programming problem (LPP):

Max Z= 4x + 3y

subject to the constraints:

$x\le 8, y\le 4, x\ge 0, y\ge 0$. At what coordinates will the objective function have optimal solution?

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

The point at which the maximum value of the function $Z=x+y$, subject to the constraints $x+2y\leq70$, $2x+y\leq95$, $x,y\geq0$, is obtained, is:

For the linear programming problem (LPP):

Maximize $Z = x + 1.5y$, subject to constraints,

$x + 2y \leq 40$, $2x + y \leq 40$, $x + y \leq 25$, $x \geq 0$, $y \geq 0$.

Which of the following is NOT correct?

For the constriants $x + y \le 60$, $5x + y \le 100$ and $x \ge 0, y \ge 0$, the feasible region is:

Objective function of LPP is:

Corner points of the bounded feasible region determined by the system of linear constraints are (0, 3), (1, 1), and (3, 0). Let $Z = px+qy$, where $p,q>0$. Condition on $p$ and $q$ so that the minimum of Z occurs at (3, 0) and (1, 1) is