Save trees use e-Question Paper Go green DOWNLOAD THIS FREE AT www.viuresource.com 10ME? vse [ Seventh Semester B.E. Degree Examination, Dec.2017/San.201 Operations Research ‘Time: 3 hrs. Ma - Answer FIVE full questions, selecting ‘at least TWO questions from each part. 2. Use of normal distribution tables is permitted. bs 1a Define operations research, Give the historical development of opey scarey ‘0s Marks) A farmer has 100 acre land. He can sell all the tomatoes, letwuce o 5 pe he can raise oMguce ap Z 10/- per ke 3 of lettuce and sting per acre is S ‘The price he can obtain is @ 10/- per kg of tomatoes, € 7 of radishes. The average yield per acre is 2000 kg of to 1000 kg of radishes. Labour required for Sowins, Culkiv iman-days for tomatoes and radishes and 6 man-days of 400 man-days of Jabour is available at © 100/- per man day. Formulagyifs pt LPP to maximize the farmer's profit. (08 Marks) ‘e. Define the following terms with reference to LPP: 6) Feasible solution. (i) Infeasible solution, UniBunded solution. (06 Marks) 2. Explain the concepts of degeneracy in simple tyethod, (05 Marts) b. Solve the following LPP using simplex method, Fain =X) “Xz + 2X5 Subject to: 3x, —X, 42x, $7 =2x, 44x, S12 =4x, 43x, + 8x; $1 XyyXyo%p 20 (as Marks) 3a Larsen and Toubro co Yond 5 million cubic feet of fill at four earthen dam sites [, 111 and TV in 6, 7 million cubic fees o ‘cubic feet of fill fro table. ‘can transfer the fill from three mounds A, B, C where 2, ble respectively. Costs of transportation of one million four sites in lakhs of rupees are given in the following To 1m. Afis 1017 18) From B|16 13 12 13 cl 17 20 11 I transportation plan which minimizes the total transportation cost to (12 Marks) ‘ean be assigned to 5 different machines. The following table shows the in hours for each job on various machines. Find the optimal assignment of 168 which will minimize the total installation time. (08 Marks) Machine My_Mz_My_Mi Ms 0 n 4 28 7 On Wo 4 2 5 6 9 12 14 1315 1 to 7 2 Any eveaing of Menteaten ape eae anda eqatons wie e448" 3, wl be wet as malprcice, Important Noe 1. On competing your ane, compulsory ear dagoal rosie the reasing blank pages. 1or3 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 10ME7| 4a. What isan integer programming problem? Explain the importance of integer proproanni 05 Marks Use branch and bound method o solv he following integer programming problem Zoya, =7%, +X Subject to, “x, 43x, <6 We $x, S35 x57 Xu, 20 and are integers ks) \. PART—B @ 5a. Explain the basio steps involved in PERTICPM. (04 Marks) b. Write short notes on crashing ofa project network. (04 Marks) ©. An organization has large number of activities but it is iterest@@hiA congblling a part of these activities to 7 in number. The following data i availa Activity [Precedence | Tie (ln) | to [te x Tete B Ato [16} 13] c A__[s is {22 D B [9 [9 9 E io aa fe F A __[s [3 [5 EF fs [oz "ERT network forthe a Idertity the evtical path and its dl Gi) the organization puts 47 & to complete, what is the probabili completion in 47 days. (12 Marks) 6 8. Define the term queue, State characteristics of queing system. (08 Marks) b. Patrons arrive at a reception coWMfer agg average inter arrival time of 2 minutes. The receptionist on duty te fone minute per person. (Arrivals are ag per ‘exponential and services 0isson distribution) What is thy ty (Rha person will straight away meet the receptionist? For what sitio the receptionist is busy? (ii) What i Hhggverageatoue length? ti cage number of patrons in the systerm? © ¢ waiting time of a pation? rage time a patron spends in the system? (a2 Marts) ra related to theory of games: and Max Min principle. ‘and mixed steategies. 00 Marks) b finance rule and solve the following fame whose py off mati for player A is BRANCHES | ALL 5 BB AL 3 AA 4 AS 4 (10 Marks) 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 10MEZ: 8 a,_List out any four assumptions underlying sequencing problems. oo, b. Consider the processing times (in minutes) of 5 jobs each of which most undergo, 2 machines M; and Ms in the order MyMs, Jab Machine Mi [519 Mz ‘Obtain the sequence for the jobs that mini time of both the machines. . There ate five jobs, cach of which is to be processed through m: Cin the order CAB, processing time in hours is given below: (08 Marks) 30f3 BRANCHES | ALL SEMESTERS | NOTES | QUESTON PAPERS | LAB MANUALS A Viuresource Go Green initiative