Target Exam

CUET

Subject

-- Applied Mathematics - Section B2

Chapter

Linear Programming

Question:

Match List-I with List-II

List-I List-II
(A) Common region determined by all linear constraints of a LPP (I) Constraints
(B) In a LPP the linear function which has to be maximised minimized (II) Optimal solution
(C) In a LPP, the linear inequalities or restrictions on the variables (III) Objective function
(D) Any point in the feasible region that gives the optimal value of the objective function (IV) Feasible

Choose the correct answer from the options given below :

Options:

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

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

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

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

Correct Answer:

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

Explanation:

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

List-I List-II
(A) Common region determined by all linear constraints of a LPP (IV) Feasible
(B) In a LPP the linear function which has to be maximised minimized (III) Objective function
(C) In a LPP, the linear inequalities or restrictions on the variables (I) Constraints
(D) Any point in the feasible region that gives the optimal value of the objective function (II) Optimal solution