Linear programming, Queueing and Dynamic problem

Question

Match List I with List II and select the correct answer using the codes given below the lists:              

         List-I

         (A) Linear programming problem

         (B) Queuing problem

         (C) Dynamic problem

         (D) Game theory problem

         List –II

         1. Travelling salesman   

         2. Saddle point

         3. Product mix

         4. Normal distribution

         Codes:

             A        B         C         D

         (a) 3        4          1          2

         (b) 4        3          1          2

         (c) 3        4          2          1

         (d) 4        3          2          1

Answer 1

answer is option B