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 Linear Programming Problem?
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → $x - y \geq 1$ ##
We observe, $(0, 0)$ does not satisfy the inequality $x - y \geq 1$.
So, the half-plane represented by the above inequality will not contain origin. Therefore, it will not contain the shaded feasible region.