Target Exam

CUET

Subject

Section B1

Chapter

Linear Programming

Question:

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?

Options:

$x + y \geq 2$

$x + 2y \leq 10$

$x - y \geq 1$

$x - y \leq 1$

Correct Answer:

$x - y \geq 1$

Explanation:

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.