Match List-I with List-II
| List-I | List-II | ||
| (A) | Corner point of a feasible region | (I) | The line segment joining any two arbitrary points of the region always lies entirely within the region |
| (B) | Bounded feasible region | (II) | can not be enclosed within a circle |
| (C) | Unbounded feasible region | (III) | can be enclosed within a circle |
| (D) | Convex region | (IV) | is a point of intersection of two boundary lines in the feasible region |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → (A)-(IV), (B)-(III), (C)-(II), (D)-(I)
Each item matches its definition in linear programming.
(A) Corner point of a feasible region
This matches (IV) is a point of intersection of two boundary lines in the feasible region.
(B) Bounded feasible region
This matches (III) can be enclosed within a circle. A region is bounded when it lies inside some circle.
(C) Unbounded feasible region
This matches (II) can not be enclosed within a circle. It extends without limit in some direction, so no circle, however large, contains it.
(D) Convex region
This matches (I) The line segment joining any two arbitrary points of the region always lies entirely within the region. This is the definition of a convex set; every feasible region of an LPP is convex.
So the matching is (A)-(IV), (B)-(III), (C)-(II), (D)-(I).