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_1 x_1+c_2 x_2+...+c_{n} x_{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:

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

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

The correct answer is Option (3) - (A)-(III), (B)-(I), (C)-(IV), (D)-(II)