Match List-I with List-II
| List-I | List-II | ||
|---|---|---|---|
| Description | Term | ||
| (A) | The conditions \(x \ge 0, y \ge 0\) in a linear programming problem | (I) | Corner point |
| (B) | A feasible region that can be enclosed within a circle | (II) | Decision variables |
| (C) | A point of the feasible region where two boundary lines meet | (III) | Non-negative restrictions |
| (D) | The variables x and y whose values are to be decided | (IV) | Bounded region |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 3
The correct answer is Option (3) → (A)-(III), (B)-(IV), (C)-(I), (D)-(II)
These are basic terms of a linear programming problem.
(A) The conditions \(x \ge 0, y \ge 0\) in a linear programming problem
This matches (III) Non-negative restrictions: they say that the variables cannot take negative values.
(B) A feasible region that can be enclosed within a circle
This matches (IV) Bounded region. A region that extends without limit in some direction is unbounded.
(C) A point of the feasible region where two boundary lines meet
This matches (I) Corner point, also called a vertex of the region.
(D) The variables x and y whose values are to be decided
This matches (II) Decision variables: the objective function \(Z = ax + by\) is written in terms of them.