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

Step-by-step solution

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 x+y 2 . 2. The line x-y=1 passes through (1,0) and (3,2) . The region lies to the left of this line, so the constraint is x-y 1 . 3. The line x+2y=10 passes through (0,5) and (10,0) . The region lies below this line, so the constraint is x+2y 10 . 4. The region is