Match List-I with List-II.
| List-I | List-II |
| (A) The set of decision variables which satisfy all the constraints and non-negativity condition of an LPP is called | (I) Corner point |
| (B) A point in the feasible region for a LPP which is the intersection of two boundary lines is called | (II) Convex polygon |
| (C) A feasible solution of a LPP that optimizes the objective function is called | (III) Feasible solution |
| (D) The feasible region for a LPP is always a | (IV) Optimal feasible solution |
Choose the correct answer from the options given below :
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
(A) The set of decision variables which satisfy all the constraints and non-negativity condition of an LPP is called
This matches (III) Feasible solution
Any point that satisfies every constraint, including x ≥ 0 and y ≥ 0, is a feasible solution.
(B) A point in the feasible region for a LPP which is the intersection of two boundary lines is called
This matches (I) Corner point
A corner point (vertex) of the feasible region is where two of its boundary lines meet.
(C) A feasible solution of a LPP that optimizes the objective function is called
This matches (IV) Optimal feasible solution
The feasible solution at which z is greatest (or least, as required) is the optimal feasible solution.
(D) The feasible region for a LPP is always a
This matches (II) Convex polygon
The feasible region is the common part of half-planes bounded by straight lines, so it is a convex region with straight edges, that is, a convex polygon.