In the context of linear programming,
Match List – I with List – II.
|
LIST I |
LIST II |
|
A. Z = 250x + 75y |
I. non-trivial constraints |
|
B. 5x + y ≤ 100, x - y ≤ 4 |
II. feasible solution |
|
C. x, y ≥ 0 |
III. objective function |
|
D. points within and on the boundary of the shaded region |
IV. Trivial constraints |
Choose the correct answer from the options given below:
Answer & explanation
Correct answer: option 1
The correct answer is Option (1) → A-III, B-I, C-IV, D-II
$\text{In linear programming:}$
$(A)\;Z=250x+75y \rightarrow \text{Objective function} \Rightarrow (III).$
$(B)\;5x+y\le100,\;x-y\le4 \rightarrow \text{Non-trivial constraints} \Rightarrow (I).$
$(C)\;x\ge0,\;y\ge0 \rightarrow \text{Trivial constraints} \Rightarrow (IV).$
$(D)\;\text{Points within and on the boundary of the shaded region} \rightarrow \text{Feasible solution} \Rightarrow (II).$
$\text{Correct matching: }A\!-\!III,\;B\!-\!I,\;C\!-\!IV,\;D\!-\!II.$