R D Sharma Solutions for Chapter: Linear Programming, Exercise 6: MULTIPLE CHOICE QUESTIONS (MCQs)

Consider a LPP given by
Minimum $Z=6 x+10y$
Subjected to $x\ge 6; y\ge 2; 2x+y\ge 10; x,y\ge 0$
Redundant constraints in this $LPP$ are

The objective function $z=4 x+3y$ can be maximised subjected to the constraints $3x+4y\le 24,8x+6y\le 48,x\le 5,y\le 6;x,y\ge 0$

If the constraints in a linear programming problem are changed

Which of the following statements is correct?

Which of the following is not a convex set?

By graphical method, the solution of linear programming problem

Maximize $\mathrm{Z}=3x_1+5x_2$

Subject to $3x_1+2x_2\le 18$

$x_1\le 4$

$x_1\ge 0,x_2\ge 0,\text{ is }$

The value of objective function is maximum under linear constraints

The corner points of the feasible region determined by the following system of linear inequalities: $2x+y\le 10,x+3y\le 15,x,y\ge 0\text{ are }(0,0),(5,0),(3,4)$and $(0,5).$ Let $Z=px+q{y}_{\text{'}}$ where $p, q>0.$ Condition on $p$ and $q$ so that the maximum of $Z$ occurs at both $(3, 4)$ and $(0,5)$