Target Exam

CUET

Subject

-- Mathematics - Section B1

Chapter

Linear Programming

Question:

Consider the LPP: Max $Z= 5x + 3y$ subject to $3x+5y≤15,5x + 2y≤ 10,x ≥0,y≥0$

Match List-I with List-II

List-I

List-II

(A) Objective function

(I) $3x+5y≥15$

(B) One constraint

(II) $x,y≥0$

(C) Non-negative restrictions

(III) $Z=5x+3y$

(D) Point (1, 2) does not lie in the region

(IV) $3x+5y≤15$

Choose the correct answer from the options given below.

Options:

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

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

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

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

Correct Answer:

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

Explanation:

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

List-I

List-II

(A) Objective function

(III) $Z=5x+3y$

(B) One constraint

(IV) $3x+5y≤15$

(C) Non-negative restrictions

(II) $x,y≥0$

(D) Point (1, 2) does not lie in the region

(I) $3x+5y≥15$

Given LPP: $\max Z=5x+3y$ s.t. $3x+5y\le15,\;5x+2y\le10,\;x\ge0,\;y\ge0$.

(A) Objective function → $Z=5x+3y$. (III)

(B) One constraint → $3x+5y\le15$. (IV)

(C) Non-negative restrictions → $x,y\ge0$. (II)

(D) Point $(1,2)$ does not lie in the region → statement equivalent to $3x+5y\ge15$ (false for $(1,2)$), so match (I).

Final matching: (A)–(III), (B)–(IV), (C)–(II), (D)–(I)