Match List - I with List - II.
| List - I | List - II |
| (A) The common region determined by all the linear constraints of a L.P.P. is called | (I) corner point |
| (B) A point in the feasible region which is the intersection of two boundary lines is called, | (II) non-negative |
| (C) The feasible region for an LPP is always a | (III) feasible region |
| (D) The constraints \(x, y \ge 0\) describes that the variables involved in a LPP are | (IV) convex polygon |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
(A) The common region determined by all the linear constraints of a L.P.P.
This matches (III) feasible region. Every point of this region satisfies all the constraints, so it is the feasible region.
(B) A point in the feasible region which is the intersection of two boundary lines
This matches (I) corner point. A vertex of the feasible region, where two boundary lines meet, is a corner point.
(C) The feasible region for an LPP is always a
This matches (IV) convex polygon. The region common to half-planes is always convex; when it is bounded it is a convex polygon.
(D) The constraints \(x, y \ge 0\)
This matches (II) non-negative. They say that the variables cannot take negative values: the non-negativity constraints.