Match List-I with List-II
| List-I | List-II |
| (A) In a linear programming problem (LPP), the linear inequalities or restrictions on the variables are called | (I) Feasible Region |
| (B) In an LPP, the linear function which has to be maximised or minimised is called a | (II) Convex set |
| (C) The common region determined by all the linear constraints of an LPP is called | (III) Linear objective function |
| (D) The feasible region, for an LPP is always a | (IV) Linear Constraints |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → (A) - (IV), (B) - (III), (C) - (I), (D) - (II)
(A) The linear inequalities or restrictions on the variables
This matches (IV) Linear Constraints.
(B) The linear function which has to be maximised or minimised
This matches (III) Linear objective function.
(C) The common region determined by all the linear constraints
This matches (I) Feasible Region.
(D) The feasible region of an LPP is always a
This matches (II) Convex set. It is the common part of half-planes, and the intersection of convex sets is convex.
So the matching is (A) - (IV), (B) - (III), (C) - (I), (D) - (II).