MCQ
In a linear programming problem, the constraints on the decision variables $x$ and $y$ are $x-3 y \geq 0, y \geq 0$, $0 \leq x \leq 3$. The feasible region
  • A
    is not in the first quadrant
  • B
    is bounded in the first quadrant
  • C
    is unbounded in the first quadrant
  • D
    does not exist

Answer

From the graph, we can say that the feasible region is bounded in the first quadrant.
Image

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free