ExamBro
ExamBro
CUET · MATHS · PYQ PAPER 2023

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 :

  1. A is not in the first quadrant
  2. B is bounded in the first quadrant
  3. C is unbounded in the first quadrant
  4. D does not exist
Verified Solution

Answer & Solution

Correct Answer

(B) is bounded in the first quadrant

Step-by-step Solution

Detailed explanation

Vertices of the feasible region are: \(x=0, y=0 \implies (0,0)\) \(x=3, y=0 \implies (3,0)\) \(x=3, x=3y \implies 3=3y \implies y=1 \implies (3,1)\) The feasible region is a triangle with vertices \((0,0), (3,0), (3,1)\). This region is bounded and lies entirely in the first…
Same subject
Explore more questions on app