Match List-I with List-II. List-I

CUET Preparation Today

Start Free Mocks

Home Questions KEJQ2FZWQP

Target Exam

CUET

Subject

-- Applied Mathematics - Section B2

Chapter

Linear Programming

Question:

Match List-I with List-II.

List-I		List-II
(A)	Corner points of the feasible region for a LPP are (0, 0), (0, 3), (4, 0). The maximum value of objective function $z=3x+5y $ is,	(I)	0
(B)	Corner points of the feasible region for a LPP are (0, 0), (2, 4), (3, 0), (5, 2). The minimum value of objective function $z=x+6y $ is,	(II)	4
(C)	Corner points of the feasible region for a LPP are (0, 0), (0, 5), (7,0), (2, 3), The maximum value of objective function $z=10x+30y$ is ,	(III)	15
(D)	Corner points of the feasible region for a LPP are (1, 0), (0, 1), (2, 4), (3, 2), The minimum value of objective function $z=6x+4y $ is,	(IV)	150

Choose the correct answer from the options given below :

Options:

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

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

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

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

Correct Answer:

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

Explanation:

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

(A) $Z_{(0,3)}=3×0+5×3=15$ (III)

(B) $Z_{(0,0)}=3×0+6×0=0$ (I)

(D) $Z_{(0,1)}=6×0+4×1=4$ (II)