List-I | List-II | ||
A. | Linear programming problem | 1. | Travelling salesman |
B. | Queuing problem | 2. | Saddle point |
C. | Dynamic problem | 3. | Product mix |
D. | Game theory problem | 4. | Normal distribution |
A) A\[\to \]3, B\[\to \]4, C\[\to \]1, D\[\to \]2
B) A\[\to \]4, B\[\to \]3, C\[\to \]1, D\[\to \]2
C) A\[\to \]3, B\[\to \]4, C\[\to \]1, D\[\to \]2
D) A\[\to \]4, B\[\to \]3, C\[\to \]2, D\[\to \]1
Correct Answer: A
You need to login to perform this action.
You will be redirected in
3 sec