In the context of linear programming, Match List – I with List – II.
Choose the correct answer from the options given below: |
A-III, B-I, C-IV, D-II A-III, B-IV, C-I, D-II A-IV, B-I, C-II, D-III A-II, B-I, C-IV, D-III |
A-III, B-I, C-IV, D-II |
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.$ |