(6) Printed Pages : 6 tal Ne. tne (0) he folloving ble sow the jos of « ‘moet cae rts eons Th Sass 576311(76) ToT |S [a3 [os [ST we pstatsl2]statiate 676311(76) mle{sfalstn|s|4|olis 4 [adi el ae ee MBA (Sensi ‘@) Draw the project network. a rte! {@) Modine cle pth tnd ein. (en Scheme) (ii) Find the probability of the project being )ptimization Methods completed in 31 days. a aa [Given area 0 to 2.166 = 0.4886). 8 pe iy ‘baile: i (5 ail ed iyi, ry ins Pass Mars 32 Tslatheg hed eae plier, Foes Aiea pr fom (0h) ed (©) ‘relationships are given below ‘of each question. Use of calculator, log tables ob [ta] v3] 23 [2s] 3-4]36] 45 [es [se] e7] ‘and statistical tables is permitted. Beselistisl [sta fe] sul |u| (@. The figures in the right-band margin indicate Does aa oper liagram representing the } iat (Gi) Find the crtcal path and the total project | 1. (@) A firm manfactress two products A end — Don Wiebe ores pale (i) Caine ol ht cach svi. g a cal cd pect ah poss ae is occu pacts aa (©) Dies te snes neces of Diss te sin F Foc A oniad sl eng ‘me on M1 and two minutes on M2; while | B requires one minute on MI and one ‘minute on M2. reas a0 Tem (Chen Ove)@ @ “Machine MI is availabe for not more than for every unsatisfied demand unit which ae T hxs. 30 minutes while machine M2 is ‘given by 5,3 and 2 for destination D1, D2, avalable for 10 hr uring any working dey. ‘and D3 respectively. Find the optimal Find the numberof units of products A and solution. 8 [Biobe manufactured to get maximum profit, 8 (®) Food X contains 6 units of vitamin A per gram and 7 units of vitamin B per gram () There ae three factories A,B and C, which supply goods to four dealers D1, D2, D3, DS. The production capacities of these oi ae factories are 1000, 700 and 900 units per contains 8 units of vitamin A per gram ‘month respectively, The requirements from 12 units of vitamin B per gram and costs Bs nx the dealers ae 900, 80, 500 and 400 units 20 paise per gram, The daily minimam ms Finan per mon respectively. The per unit ets ‘requirement of vitamin A and vitamin D is (Cicluing transportation cast) are Rs. 8, 10h sa nd a ease Pt Re, 7 and Rs. 9 at three fectories. The tie minimum cost of product mix following bl gives ar wit transporaton simplex method. ° 8 cts from the factories othe dealers (6) Whatisthe significance ofthe duality theory Di] D2 | Da] De ofliner programing? Describe the gene rules for writing the dual of linear K[z[2}2]4 ‘rogranming problem. 5 pis|s}3]2 Ta ce jata]2}i 7 2 (@) Consider the following unbalanced Determine the optimum solution to separation problem : maximize the total tums. aie (©) Write note on tracing closed loop. What 3 ol are the characterises features of « closed ots 17 loop? 8 ons a6 Voie [32s] 3 (@) A firm produces four products. There are Dem | [95 2050] 10 trceeentetete we epate strctecoa Since tere is not enough soppy, some of cach of them. The processing tine varies the demands at these destnatons may not ‘om operator to operator. The frm works be satsiod. Suppose there are penalty costs Shoes a dy end llows 30 ime for hnch. reas Comimed) rom (in ve)ro) “The processing times in minutes and profits ‘of each of the product are given below Operators Products Rw Ne na 1 ap ee OT iz 1 aie ey 3 25. Saetde oad 4 is 9 0 Profit Rumi) 8 6~~«S Find the optimal asignment of esch product to operators. { @ Five wagons WI, W2, W3, Wand WS are available at stations. These are required at five station, IV, and V. The mileages ‘between various stations are given by the ‘able below. How should be wagons be ‘ransported so as to minimize the total Teast mileage covered? To a wifio fs | 9 | is | a wi] 9] 6] 2] ws} 3} 2] 4]a]s wa] is] 9 | 12 far fas ws| un | 6 | | 9 | 0 Coniraed) © “ ‘What is the travelling salesman model? ‘What are its practical applications? How docs its solution differ from the solution of the assignment problem? 8 Univ ‘You are given the following data regarding the processing times (in hr) of some jobs fon three machines Ml, MII and MII. The order of processing is MI-MII-MIIl Determine the sequence that minimizes the total elapsed time (1) required to comple the jobs. Also evaluate T and idle time of MII and MIIL Jobs [A D ¢ mt | 3 mu | 4 mm __| 6 cs E apa 7 2}s}a 3 siuls 2 er © © rom ‘AT Repair man finds thatthe time spent ‘om his job bas an exponential distribution with mean 30 minutes, if he repairs sets in order in which they come, and ifthe aval of sets is approximately Poisson with an average rate of 10 per 8 hours day. What is the repair man's expected idle time each dhy? How many jobs are ahead of the set just brought in? 8 ‘What is a queuing problem? Explain the ‘general structure of the queuing system? 8 (nen ove)