The feasible region corresponding to the linear constraints of a Linear Programming Problem (LPP) is represented by the shaded region in the given figure. Which of the following is not a constraint to the given LPP?

$x-y≥1$

The correct answer is Option (3) → $x-y≥1$

The shaded region lies below the line $x - y = 1$.

That means the actual constraint must be:

$x - y \le 1$

The option $x - y \ge 1$ represents the region above the line, which does NOT include the feasible region.

Thus, the constraint that is NOT part of the LPP is $x - y \ge 1$.