CUET Mathematics - In a linear programming problem, the constraints on decision variables x and y are -2x ≤ 0, y ≥ 0, x ≥ 0, x ≤ 5. The feasible region of the above problem: | PYQs + Solutions | AfterBoards