UGC NET CSE | June 2012 | Part 3 | Question: 46

Question

The feasible region represented by the constraints $x_1 - x_2 \leq 1, x_1 + x_2 \geq 3, x_1 \geq 0, x_2 \geq 0$ of the objective function Max $Z=3x_1 + 2x_2$ is

• A. A polygon
• B. Unbounded feasible region
• C. A point
• D. None of these

Answer 1

Ans is B as feasible region away from the origin is unbounded

Comments

But region for the inequality x1−x2≤1 should be towards the origin instead of away from it as if we put (0,0) in it we get 0 which is less then 1 hence (0,0) will lie in that region.