Match List - I with List - II.
| List - I | List - II |
| (A) The common region determined by all the constraints of LPP is called | (I) objective function |
| (B) Minimize \(z=c_1x_1+c_2x_2+.....+c_nx_n\) is | (II) convex set |
| (C) A solution that also satisfies the non-negative restrictions of a LPP is called | (III) feasible region |
| (D) The set of all feasible solutions of a LPP is a | (IV) feasible solution |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
(A) The common region determined by all the constraints of LPP is called
This matches (III) feasible region. The region where all the constraints, including the non-negative ones, hold together is the feasible region.
(B) Minimize \(z=c_1x_1+c_2x_2+.....+c_nx_n\) is
This matches (I) objective function. The linear function to be maximised or minimised is the objective function.
(C) A solution that also satisfies the non-negative restrictions of a LPP is called
This matches (IV) feasible solution. A point of the feasible region, satisfying the constraints and the non-negative restrictions, is a feasible solution.
(D) The set of all feasible solutions of a LPP is a
This matches (II) convex set. The feasible region of an LPP is a convex set: the line segment joining any two of its points lies inside it.