ExamBro
ExamBro
MHT CET · Maths · Linear Programming

The solution for minimizing the function \(\mathrm{z}=x+\mathrm{y}\) under an L.P.P. with constraints \(x+\mathrm{y} \geqslant 2, x+2 \mathrm{y} \leqslant 8, \mathrm{y} \leqslant 3, x, \mathrm{y} \geqslant 0\) is

  1. A at the point \((0,3)\)
  2. B at the point ( 8,0 )
  3. C at infinite number of points but bounded set
  4. D at unbounded set
Verified Solution

Answer & Solution

Correct Answer

(C) at infinite number of points but bounded set

Step-by-step Solution

Detailed explanation

Feasible corner points: \((0,2), (2,0), (8,0), (2,3), (0,3)\) \(z(0,2) = 0+2 = 2\)