Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com BGS SCnlelilg 1SMESI jemester B.E. Degree Examination, June/July 2019. Operations Research “Time: 3 hrs. Max. Marks Note: J, Ansover any FIVE full questions, choosing ONE full question from each modale. 2, Use of statisti tables ts permitted. ‘Module-1 1a, List and explain briefly the phases of operations reser A paper manufacturing company produces two grades of Because of raw material resthietiors, not more than 50 tonnes grade S papers can be produced por wesk. It R paper and 0 hours to proce per week. The proit per tonne of 1 15 Rs. 500, Formulate mathematical model to deers tongs oF grad R and rade S papers the company’ has 4 produce per We mize ils profit, Solve graphically, (0 Marks) on, 2 a _Disouss the limitations of operations rese (Ws Marks) bb. Solve the following LPP by graphical me sate the solution Maximize 2= 2x) 3: ‘Subject 0 constraints < with x1. slack, surplus snd antici variables in LPP? 1 Solve the following bs lethad Maximize Z = 65) Subject to consyats (2 Marks) os sank) Rieke +6% 8S with x).95,89 20. (oxaras) hor BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiativeSave trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com 1SME8 Modyle:3 5 Discuss its commequence and how iffover olan he optinam solution (0 the following transportation problem to minimize (Rygeal transportation cost nial solution by Vogel's approwimation method. (VAM). Destination [DTDs | Ds [Daj Supply @ (lo, far pas tae far 0. [a0 [39752 [31 0; a Demand | € " i aa 6 & Explain the difevences between assignment problem tion problem. (05 Marks 1h A small machine shop fas five jobs to be assigned to The following matrix indicates the cost of assigning each ofthe five jobs to eacM@he Hive machines. Obtain the total assignment cost 7 a Exphunthe Kendall 1h A small proyet prevedence relgpnst likely and possi cr = for representing queuing model os ents) ‘of AaHfes om °A™ to The following table indivates the ong activities and the three time estimates ~ optimistic. most ~ cach atv in ass zeexsor | Optic [Most likely | Pessimistic lationship | time: time ty” | time” ‘iy 11 Draw the projet network. Determine the expected time and variance for each astisity 1) Obiain th total expected daration oF te proget and critical path In) Whats the probabty of completing the proyet in 50 days? (2 Marky 2of3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiativeSave trees use e-Question Paper DOWNLOAD THIS FREE AT www.viuresource.com ISMESI on For the following et of actvitiss of a project, draw the network and obtain Early Start [ES]. Finish (LE for cash activity. Also. inde The mean arrival rat 1 a service centre i 3 per hour. The mes sg IW ainutes per service. Assuring Poisson arival and exponent #)- Utilization factor forthe service facility Probability oF b¥0 uns inthe system Queue lath iv) Expected waiting time in the system (0 Marks) Module-s x Apply the rues of dominance to reduce the gag (2 + Spl solve the game o obsain ame value and optimum strategies fr bh te pb a 6 cox ants) 3 1] a os stats) oR 10 RRpcessed on a single machine. The following table indicates the essing time in hours. Obtain the optinwin sequence of jobs by SPT] vlc that minimizes the mean flow time. AIS obrain ory : (6 Marks A[BICIP|E[ FIG rocessing timeayinfe [STS ST 4 1319 6 Theis ® to be processed on thvee machines A, B and C inthe onder CAB. The sc janie indicates the processing time in hours for the six jobs on the three machines. uum sequence of jobs that minimizes the tral elapse time for completing all the jobs om the tee machines. Also indicate the idl time of each machine. 12 inhourson MCA in hours on ML Marks) wee sors cee Go green BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative