Target Exam

CUET

Subject

-- Applied Mathematics - Section B2

Chapter

Linear Programming

Question:

Maximize $Z = x + y$,

Subject to constraints: $x, y ≥ 0, x – y ≤ –1, x ≥ y$

Options:

$Z=0$

$Z=1$

$Z=4$

No feasible solution

Correct Answer:

No feasible solution

Explanation:

The correct answer is Option (4) → No feasible solution

Plotting the graph, we can see that there is no possible feasible region for the given constraints.

Hence the given LPP has no solution and Z cannot be maximized.