Target Exam

CUET

Subject

-- Applied Mathematics - Section B2

Chapter

Linear Programming

Question:

Match List - I with List - II.

List - I

List - II

 (A) The common region determined by all the linear constraints of a L.P.P. is called 

 (I) corner point 

 (B) A point in the feasible region which is the intersection of two boundary lines is called, 

 (II) non-negative 

 (C) The feasible region for an LPP is always a 

 (III) feasible region 

 (D) The constraints x, y ≥ 0 describes that the variables involved in a LPP are 

 (IV) convex polygon 

Choose the correct answer from the options given below:

Options:

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

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

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

(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)

$\text{(A) Common region of all constraints} \Rightarrow \text{Feasible region}$

$\Rightarrow \text{A matches (III)}$

$\text{(B) Intersection point of boundary lines} \Rightarrow \text{Corner point}$

$\Rightarrow \text{B matches (I)}$

$\text{(C) Feasible region of LPP} \Rightarrow \text{Convex polygon}$

$\Rightarrow \text{C matches (IV)}$

$\text{(D) } x,y \ge 0 \Rightarrow \text{Non-negative variables}$

$\Rightarrow \text{D matches (II)}$

A–III,\; B–I,\; C–IV,\; D–II