Question

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₁x1+C2x2+.....+Cnxn 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:

• A. (A)-(I), (B)-(III), (C)-(IV), (D)-(II)
• B. (A)-(II), (B)-(IV), (C)-(I), (D)-(III)
• C. (A)-(III), (B)-(I), (C)-(IV), (D)-(II)
• D. (A)-(IV), (B)-(III), (C)-(II), (D)-(I)

Answer 1

The Correct Option is C

To solve the problem of matching LIST I with LIST II in the context of Linear Programming Problem (LPP), we need to understand each term:

1. The common region determined by all the constraints of LPP is called: This is known as the feasible region, where all constraints intersect and potential solutions exist. Hence, A matches with III.
2. Minimize z = C₁x₁+C₂x₂+.....+Cₙxₙ is: This expression represents the objective function, which is to be minimized or maximized in an LPP. Thus, B matches with I.
3. A solution that also satisfies the non-negative restrictions of a LPP is called: Such a solution is termed a feasible solution, which is viable under given constraints in LPP. Therefore, C matches with IV.
4. The set of all feasible solutions of a LPP is a: This forms a convex set, as it includes all possible solutions that meet the constraints. Consequently, D matches with II.

The correct matching is: (A)-(III), (B)-(I), (C)-(IV), (D)-(II).