Fr. C. Rodrigues Institute of Management of Studies Navi Mumbai Time: 3 hours Marks: 60, Subject: Operations Research Batch & Ye ist Year Second Semester (2017-2018) Instructions: ‘The question paper is divided in two sections. 1 2. Question no 1 is compulsory and carries 20 marks. 43. Answer any 4 questions from Question no 2 to Question no 7. “4. Bach question from Question no 2to question no 7 have three sub-questions. Answer any two of these sub- questions. Question no 20 1 “Linear Programming technique is used to allocate scarce resources in an optimum manner in problems of 2 Schedule >. Product Mix © BothAandB 4. Servicing cost ‘Any solution to a LPP which satisfies che non- negativity restrictions of the LPP is called its ‘Unbounded solution Optimal solution Feasible solution Non-feasible solution Objective of CPM network analysis ‘Minimize total project duration Minimize total project cost Minimize production delays, interruption and conflicts All of the sbove peer eo peer Te purpose of dummy row or column in an assignment problem isto ‘A. obtain balance between total activities and total resources prevent solution from becoming degenerate C. provide a means of representing a dummy problem D. none of the above ‘Which statement describes the Weak Duality Theorem? 2. Finite optimal solutions ofthe primal and dual problems have the same value of objective functions b. Objective function of the minimization problem may not be smaller than that ofthe maximization problem ©. Objective function of the minimization problem may not be greater than that of the maximizstion problem 4. faprimal problem has finite optimal solution, the dual problem has also a finite optimal solution Maximal ‘low technique If tere is a tic in the "ninimum-ratio test" ofthe simplex method, the solution in the next tableau Will be non-basic 1b, —Willbave a worse objective value & Willbenon-feasible 4d Willbe degenerate ‘The sade point in & payoff matrix is always the a. Largest number in the matrix b. Smallest number in its column and the smallest number in its row ©. Smallest number in the matrix <<. —_Largest number ints column and the smallest number in its row Operations Research Page Apel 2018Fr. C, Rodrigues Institute of Management of Studies ‘Navi Mumbai ‘Which ofthe following is not one of the assumptions of an M/M/I model? ‘Amvivals are independent of preceding arrivals but the arrival rate does not change overtime. b. _Amtivals are served on alas, fst-served basis Service times follow the negative exponential probability distribution. 4. Arivals follow the Poisson distribution and come from an infinite population 9. Cumulative probabilities ae found a. Summing all the probebiios associated with a variable, . Simulating the inital probabiliy disuibution. ©. Summing all the previous probabilts up tthe current value ofthe variable & —_Anymmethod one chooses. 10, The earliest stare (ES) ofan activity isthe, carlos finish (EF) ofthe immediate a. Smallest, successors BLargest, successors Smallest, predecessors &. Largest, predecessors [SD] & A hospiad administrator for large Hospi, tying wo detennine whether to bald lage wing onto] 3 | the existing hospital, a small wing. Ite population of city continues to grow, a large wing could | return $150,000 to the hospital each year. Ifthe small wing were built it would rerum $60,000 to the hospital each yea ifthe population continues grow. I the population of te city remains the sare, | the hospital would encounter a lose of SE5,000 if the large wing were built. Farhemmore, a fos of | $45,000 would be realized if the small wing were constructed snd the population remains the same. | ‘aforaunately, the administrator doesnot have aay information abou the future population of Portland i. What ype of decision problem is his? fi, Constrct «decision table ii Using the equally likely enteroo, maxima and maximin determine the best alternative. Solve the following using the rales of dominance and solve forthe value ofthe game 5 PayeB PayerA_[ BI B Bi Be AL AD Ss aa c. Define sla variables, surplus variables and anfical verablee? Give examples foreach, What are the | 5 two different methods of solving minimization problems i linear programming 5 | & Formulate te following ino atandardLP form (cnonieal form) 3 Max2== 34, +22 Subjecttox +m <4 %-% 22 1 2 O.m, ls unrestricted A pharma firm manufactures hetdache pls in wo sizes Aand B. Size A contains? grains of aspitin, 5 | 5 grains of bicarbonate and | grain of codeine, Size B contains 1 gain of asprin, 8 grains of bicarbonate tnd 6 grains of codeine. Its found by users that it requires at least 12 grein of asprin, 74 gains of bicarbonate and 24 grain of codeine for providing iumedite effect. It is equited to determine the last ruber of pills a patient should ake to get immediate relief Formats the problem as a LPP. (Operations Research Page? Apal2018Fr. C. Rodrigues Institute of Management of Studies Navi Mumbai © What is sensitivity analysis i a Tnear programming model? What is ie economic Interpreation of | 5 sensitivity analysis of ight band side of constrains equations? G4 | a Solve the following LP problem using graph. Show the is-proi Tine clearly onthe graph Zi Maximize Z = Sz, + 8 x, subjected to following constrain's nt 3x 900 Yy mt Yzx, $300 Yq xt gr $100 and, x 20 | | 1b. Which are binding constraints? You ned to do sensitivity analysis for the objective function coefficient | $ and find out the ranges ofthe coeficents for which the optimal point will not change? What wll be the dual price for binding constraints? ©. Write the dual for the following primal problem 3 Min Z = 7x, + 3.x, + 8 xy subjected 0 following constraints But inti 23 3%t 6%+4% 24 Amt mtSn 21 mt 5x 42x 27 andx, &u&x, 20 US | a Find the inital solution forthe following problem using Vogel's Approximation method 3 | Destination | | Dewtnation2 | Destination 3 | Destination © | Suppl } Soweet| 21 16 15 B it | Source =| 17 18. 14 23 5 Souce3| 32 Fu 18 a io Demand 6 ie 2 15 . Solve the following assignment problem 5 Task Tak? Taks Taka Worker! [8 6 3 a Worker? [6 s 3 4 Worker3 [7 3 4 6 Worker [6 T 5 6 5 (c.Write down the tinear programming model fora transportation model with two sources and 10 destinations including the consraints GS | & Inrural India, tere are six farms (numbered 1-6 connected by small roads. The distances nmiles | between the farms are given in the following table. What isthe minimum distance to go from farm 1 to farm 6? stance [From Farm | To Farm | Distance 3 4 6 3 5 2 4 5 3 4 6 6 5 6 5 Operations Reseach Page3 April 2018