Target Exam

CUET

Subject

-- Mathematics - Section B2

Chapter

Linear Programming

Question:

Match List-I with List-II.

List-I List-II
(A) The set of decision variables which satisfy all the constraints and non-negativity condition of an LPP is called, (I) Corner point
(B) A point in the feasible region for a LPP which is the intersection of two boundary lines is called, (II) Convex polygon
(C) A feasible solution of a LPP that optimizes the objective function is called (III) Feasible solution
(D) The feasible region for a LPP is always a (IV) Optimal feasible solution

Choose the correct answer from the options given below :

Options:

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

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

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

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

Correct Answer:

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