UF-331 | B.Sc. (Hon’s) Computer Science | 3rd Semester Examination, Dec., 2022 Operation Research Time : Three Hours] [Maximum Marks : 75 [Minimum Pass Marks : 30 Note : Answer from all the Sections as directed. All questions carry equal marks. Section-A 1. Answer the following questions : (@) Define operation research. Describe briefly the different phases of operation research. (6) Explain briefly the applications of.(2) Section-B 4 Answer the following questions : (a) What is Linear Programming? What are the features of linear programming ? Explain briefly the applications of linear programming, (6) Solve the following using Simplex 3x+y230 x, y20 (c) Use Simplex method to Maximize 2= 6x, + 11x, Subject to constraints, 2xy +4, $104 x +2x$ 76 Hy, 20 ee 185_BSP_UML_() (Continued)G3) Section-C 3. Answer the following questions : _{ay Find the optimal solution to the following transportation problem using MODI method : Destination Source | D1 | D2| D3 | D4 | Supply A | 3,| 5.) 4¢] 922 mim mRsi |S iG 3) (ters ae Demand] 7 | 12| 17 | 9 (8) Find the optimal solution to the following transportation problem using Stepping Stone method : Warehouse Plants | P| | & ste 5 3 6(4) (ey What do you mean by VAM? “Determine an initial basic feasible solution to the following transportation problem by using Vogel’s approximation method Source DI D4|Supply Destination](5) Workers Jobs w| pe | Ye D 10) 6] 8 7 Section-E. <~ Answer the following questions : (a) We have five jobs. Each of which must go through machines 4, B and C in the order ABC. Determine the optimal 185_BSP_U/L_(1) (Turn Over)(6) sequence of jobs that minimizes the total elapsed time, Also find the idle time for the machine 4, B and C. Processing time (in hours) is given in the following table : Jobs Machines! 1 | 2 | 3 | 4 | 5 4 |s8|{10] 6 mn ae Bigs |p Samora eee essoa| 4 eee Oo ae Ps (85 ln a factory there are five jobs to perform, cach of which must be processed on the two machines A and B in the order AB. Determine a sequence for the five jobs that will minimize the total elapsed time. Processing times in hours are as given(7) () Determine the optimal sequence of jobs that minimizes the total elapsed time. Also find the idle time. Machines (processing time in hours) Job | M | a2 | M3 | M4 A 12 5 3 12 B 9 2 9 9 CPA) 3 4 13 D | 14 a) 3 14 — ——EO—w— EE 185 BSP_U/L_(7) ue