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
- Ais not in the first quadrant
- Bis bounded in the first quadrant
- Cis unbounded in the first quadrant
- Ddoes not exist
