ExamBro
ExamBro
MHT CET · Maths · Linear Programming

The solution set for minimizing the function \(\mathrm{z}=x+\mathrm{y}\) with constraints \(x+\mathrm{y} \geqslant 2, x+2 \mathrm{y} \leqslant 8, \mathrm{y} \leqslant 3, x, \mathrm{y} \geqslant 0\) contains

  1. A \(x=0, y=3\)
  2. B \(x=8, \mathrm{y}=0\)
  3. C infinitely many points
  4. D \(x=2, \mathrm{y}=3\)
Verified Solution

Answer & Solution

Correct Answer

(C) infinitely many points

Step-by-step Solution

Detailed explanation

The objective function is \(z = x+y\). The constraint \(x+y \ge 2\) implies the minimum value of \(z\) is at least 2.