ExamBro
ExamBro
COMEDK · Maths · 35. Linear Programming

The feasible region corresponding to the linear constraints of a Linear Programming problem is given below.




Which of the following is NOT a constraint to the given LPP

  1. A \(x+y \geq 2\)
  2. B \(x-y \geq 1\)
  3. C \(x+2 y \leq 10\)
  4. D \(x-y \leq 1\)
Verified Solution

Answer & Solution

Correct Answer

(B) \(x-y \geq 1\)

Step-by-step Solution

Detailed explanation

The feasible region is a polygon bounded by the lines \(x+y=2\), \(x-y=1\), \(x+2y=10\), and the y-axis (\(x=0\)). Analyzing the boundaries of the shaded region: 1. The line \(x+y=2\) passes through \((0,2)\) and \((2,0)\). The region lies above this line, so the constraint is…