weeno[ TPT PTTT ELLIO Question Paper Code : 85515 M.B.A, DEGREE EXAMINATION, FEBRUARY 2012 ‘Third Semester DBA 170] — APPLIED OPBRATIONAL RSRARCH ROR MANAGEMENT ‘ogulation 20072009) ime: Thiee hours ‘Maximum : 100 marks ‘Asewer ALL questions PART A— (10 x 2= 20 marks) 1, List some of the applications of OR. in manufacturing. 2, Exproca the following LPP in the standard forin Minimize 22, ~ 225 +x, Subjoet to Bey + Amy + dy 24 = 2x27 and x,,, 20. and 2, is unrestricted, 3. What is basic feasible solution in transportation problems? 4. How will you resolve degeneracy during solution stage in transportation problems? 5. Whatare che applicatione of integer programming? 8. What are the basic assumptions of the game? Define ‘state! in dynamic programing 8 What are the limitations of simulation? 9. What ix olluniao? in queue discipline? 10. What is group replacemert pokey? ULD YUES LUN race‘fms mamficuons ten pres 4 el Joni the ptt aed pes itu ars Re 3 aa4 Ea = ospecive wh port presse ob lime on Af, and ta mim of arene on Ady de paces eodiet WF vqes meant oS ond ws nines. Mesire 1M; ews ser metho Thos Sse wil achine ts nallhie bv 10 Sours duciew au wrkieg dy. Foe che ember of roth, Haewilats-esave EPPand vase ly rise! meh’ ‘Wor Dig met al sae Glee spl sale Sie a oe met tne Sulve ke filbonins nisperction srexeee wine VAL eed al smasisas sbe wi tame [8 [© | [ovens a TS 7 be Ey A esl wold iy ur eis FPS anf, Thirst he Iles a I so oe, Te pe steps foe some SS, sn S she guano whe here OLD QUESTION PAPERS /1425, 35, 105 and 20, respectively. Unit cust of transportation are given in the following table, Find the transportation plan such that the toval production «ind transportation cost is minimum. SS Si Se A246 Few 8 7 5 Fo 1 8 9 12 R46 8 8 (@) Use branch and bound technique to solve the following integer programming problem Maximize 2 = 7x # 9%, Subject to =a, +82, <6 a, + y £38 "20 und 2,2 are integer. Or (b) Use dotninance paaperty and solve the following game and also find the value of the game, Player B Bs Be Ba Ag. 7 Player Ac] 6 2 7 Al 6 1 6 14. (@) A student has to take examination in three courses X,Y, He has three lays available for study. He feels it would be beet to devote a whole day to study the same conrse, so that ke many study 2 course for one day, wo days or threo days or not at ull. His estimates of grades he may got by avadying are as fellows : Study xo 2 daysleource 0 toe 4 1 29 2 2 2 4 4 3 4 6 4 How skould he plan to study so that he maximizes the sum of his gradoo? Or a 85515 ULD YUES LUN race(6 $n ese rice gs ee mm at et 9H. 6 er cup and aliit sc disuse ll eh w aavage face of Re 2 yor tap. Parl aia have ‘ated Helge 19 asd cup oe dae There tenn a Tele V9, iho sale history as Fellow ng proles, Mabelaise We 1? 1S {a am genase 06 paints pas Biase day see dae wee of fever ete 2, ome avoteg, a Pio! dee LO sss of hla. a sverage servis Gaus uf 20 aizacen tt Us ath eit such would have ta ie suageled the ci ha rere the wort Seif eg ho 1s pete aban? o 1) Thaw ae aang nator of let Malm af which ee be hin srovisigore at elsasc bly fle a tenn soos Re Lic copa sly 88 pane on lech alle Tf thw prigertéan of hats fx tng im [sgt vie neal fn stoma, oes sl hy epasemert ls Seema " " Propstins fli duag Las week ‘ropvetin tin ding econd week Provo ala dria fou ee =U OLD QUESTION PAPERS /