MBA/Sem-IVMBAE-4709) MBA (4** Semester) Examinations, 2022 Subject: Advanced Operations Research Paper: MBAE-4709 Full Marks: 89 Time -3 Hours Candidates are required to give their answers in their own words as far as applicable, Answer any five questions. Describe different methods to determine the transition probability matrix with suitable examples. ‘ 2. Solve the following Dynamic Programming problem, Maximize Z i Subject tothe constraints: WA aty =e ¥,20 | 2prglt 16 3. Solve the following Dual Simplex problem. Minimize Z = Subject to the constraints: 3x, +4, 23 43, +32, 26 +2y23 ym 20 nt 16 4. Derive the expressions forthe following fora M/A /1:.V <> Queuing system: (a) Average waiting time in queue; () Probability that there is no entity in the system, 16 5. The chairman of a certain political party is making plans for his election to Parliament. He has engaged the services of 6 volunteer workers and wishes to assign them to 3 dstits 5088 th mavimize their effectiveness. He feels that it would be inefficient to assign a worker (0 ‘more than one district but he is also willing to assign no worker to any one of the districts judging by what the workers can accomplish in other districts, ‘The following table gives the estimated increase in the number of votes in favor of the party's candidate ifit were to allocate different number of workers,2 [Number of workers | District 16 6. Briefly state the main principle of the following nature-based algorithms — (i) Genetic Algorithm; (ji) Artificial Immune System; (ii) Simulated Annealing; (iv) Tabu search, 4x4=16 7. Answer the following questions in bri (a) What is canonical form of transition matrix? (b) Mention the type of problems on which Dual ‘Simplex method and Fractional programming method can be applied. (©) Classify different types of stochastic processes. (@) Differentiate among communicating, recurrent and transient states for a Markov chain, 4x4=16 8. Consider the transition probability matrix as shown below: paler | te | 2a ane T [o1fo2]o3]oa 2 |o2/0 |os}o3 3 |o4)o1}o2|o3 4 _los}oi}os fot ‘Suppose that the state probability vector is given by the following. p=[04 0.2 0.5 0.1] Caiculate the state probability vector in the third epoch, 16 9, Define the following concepts with suitable example wherever possible: 8x2=16 (a) Reflecting barrier (b) Balking (©) Jockeying (@) Frog Leaping Algorithm (e) Memory-less property (® Kuhn-Tucker condition (g) Kendal’s notation (b) Feasible solution of Linear Programming Problem 10. Write short notes on the following: 882-16 (a) Random walk (b) Classification of Markov chain