Target Exam

CUET

Subject

-- Mathematics - Section A

Chapter

Linear Programming

Question:

For LPP: Maximize $z = 2x + 3y$ subject to the constraints $x + y ≥2, x + 2y ≥3, x ≥0, y ≥0$, which of the following graph represents the feasible region of the above LPP as shaded portion?

Options:

Correct Answer:

Explanation:

The correct answer is Option (4) →