wD toME74 ‘Seventh Semester BLE. Degree Examination, Dec.2016/Jan.2017 Operations Research Max. Marka:100 [Notes Answer any FIVE full questions, selecting atleast TWO questions from each part Bey ex the sopes of Operation Resear 1. Beet explain he copes of force oe 1b A farmer bas 10 acre firm. He can sl al tomatoes, letce oe asishs and can ty ‘ice to obtain Rs 1.00 pe for tomatoes, Rs 0.7. head for lettuce snd Ra 200 yoke Fades Toe average Yield per ate is 2600 kgs of tomtocs, 3000 beads of et too 1000 sof shes erlzrs are avaible t Rs 0.0 per Kp ade ema rune yor sere 100 ks each for trator and Tete and 50 kg for adie, Lbout esd Sor Sowing, aang ad harvesting pe acre 5 an Gye fr tates and ade nd tan dys for ets, A total of 400 man days of abou re avaleble wR 20 pr ma.) Formas this problem at & near programming mel (0 masini the fener tl ott ‘ashet) Wee the dul ofthe lowing LPP, Minimize Z= 3 ~ 643+ 8. Subject to + 029 y+ B+ 3 6x)-285— 24,5 10 wd 624 B+ Sip Xian 920 Solve the following Linear Programming problem. Maximize 2=1% +239 339% Subject tox) +2 += 15 "ny a2 +59 =2 Retgon tae 10 Kx. m, 420, Solve by sing Tw pase method. ‘asm 3) ABC Lied tas tee podocton sos spying prod oS waeouses. Te a of Focsion wares Som tap to shop como taajoston em sip 10 op co {Tmporation fom shop 10 washes ao var Each shop basa peste posse timuctyof ech warhoar has cra nut of regent Teco of apron stusguen ab stor pen cosciy [ Gon of x apap rpst ion 7 8 A 2 T 6 stettts 1s is cs T4fots TS 5 0 wo} es 105 [70 Regie Find the optimum quantiy to be supplied Hom each shop To a ‘minimum cos. of10ME74 b. AABC company has 5 tasks and 5 persons to perform. Deterine te optimal assignment ‘hat minimizes the total cost ove |, Machines Coa be ‘ABC [Dye s Flé[7ts tote [7 [shiotote RIS14[3 [ors steps stere Tatts tere 4 a. Explain the importance of integer programming. ci 1. Sole the following linear programming by Gomory technique Maximize 2=% +12 Subjectto 2 +70 56 ‘a+ Sta $20 11322 0 and integers. sms) PART=B 5) a. Define the following terms with reference to PERT = |) Total float i) Free float il) Independent oat. (oo sarts) b. project schedule has the following characteristics. ‘Activity [Time (weeks) | Aetviy [Tne (wes) 12 4 36 4 13 1 S17 = 2 r 68 H 3-4 r 78 2 3-5 6 3-10) 3 49 5 9-10) 7 4) Draw the network and find he eral path. 1) Compute EST, EFT, LST, LFT, total fost foreach activity. cesarts) 6 a. Briefly explain queuing system and is characteristics. G6sarts) '. Arrival rate of telephone call ata telephone booth are according to Poisson distbuton, with an average time of 9 minutes between two consecutive arrival. The length of telephone cal is assumed tobe exponentially distributed with mean 3rinutes. i) Determine the probability that a person arriving tthe booth wll have to wait. ii) Find the average queue length. iil) The telephone company wil install a second booth when convinced that an ariel ‘would expect to have to wait at leat 4 miautes forthe phone, Find the increase inflow rte ‘of arrivals which will justify a second booth. iy). What isthe probability that he will ave to wait for more than 10 minutes before tbe hone is fee? astarks) 7. a. Solve the following game by Graphical method. Cl B10ME7s emarnsy strategies for both he player. By By By By By By agen: ahi 322 437-512 433-222 434-122 Alea Al Al A Al 16. Use Dominance Rule to find the optimum (starts) performing the job oa 3 (saree) ‘etme, Find the sequence that minimized the total time required in ‘machines inthe ordet CBA. Define 1) Total elapsed time B if tts TBA [BIC 5 6 30f3“000 USN 10ME74 Seventh Semester B.E, Degree Examination, Dec.2015/Jan.2016 Operations Research ‘Time: 3 hrs. Max. Marks:100 [Notes 1. Answer any FIVE full questions, selecing “atleast TWO questions from each part. 2. Use of Normal distribution tables ls permitted. 4. The following are the two constraints forthe LPP under consideration w-m215 mtm27; and xin 20 t ‘sing the graphical method, answer the following questions, >. |) What are the extreme point fo the easible region? i) tthe problem bes an objective function, maximize D= Sx +22, wha isthe optial al ip Ibe probe hasan objet fenton, pig x= 3+ what the opti oe pot . ‘omer 1, Sole the folowing problem using grphicah@llod maximize Z =) + 3x Subjeto commas 25j tm 2 5) ome3 1 Ae8s> 0 sna «Titty br carters of pc teem) @ 2 a Solvette bowing LP by Bi M mend z6; 22) mitts; im n1.n0 rans ® owing pial 35000 5 6Ox=2500; On + 60x20 ; 100 +2002 7060 Sonos Por rosea ee Soret tevin aD Detain Ocean emacaek Ste eee ert sree ae By 1 at Factories B [0 chs, 4 ir 5 iz pia tefets Deterine the extent of deliveries fom each ofthe itor o each ofthe stores th ie total production and transportation cost is minimum. ome of10ME74 'b. Four machines Mi , Ma My aod M, are to be ial in machine shop. Thre ae five ‘acant places A, B,C, D aod E. Owing to the limitations machine My canoe be place a {ne Mi canot be placed at A. The signet cos of machine |to pace miners (LoD) ‘iehoun below. cy Ap c pe © Pf S Mba se wes Pe te ots zeie M r ~ ind the optimal signment hed 4 Sate ine below given otegee programing problem: Maximize Z~ 4x, #63299 Sibjerto 44-4025 aur 6055 ca teee ss x42, 20 and 3 xe integers, S 5 etn fet _ ‘Acsivity | Inmedns ie | Mos Way | esininie Pred (| Tet | te | : i 45 3 5 T 4 (ante) ey, lewla-eglee Spies Eafeoo La telesales a : 1 - a@ Lx | at 2 etwork daggers ‘RUN out th ES, EF; LS, LF and slack for each activity. Sind out the variance and standard devistion fr thecal path, ‘Deernne the probability of completing the projet in 24 rs. coma, -Meition and discuss seven elements ofa queing system. coma, Deine: () Balking (i) Renepeing (i) Jockeying foneny, (On an average 96 patents per 24 ~ hours day requis the service cfan emergency lnc. O2 ‘sm averagea patent requires 10 minutes of ective attention. The fity can hand oly one tema gency at tine, Suppose that it coats the linie £100 per patient treated to obtain an ‘eaging Service time of 10 minutes and tht each minute of decrease in this average ine ‘woul cost the clinic €10 per patent treated. How mich woul have tobe budgeted by the Meter tempest! pat pea? mM 20f3Even 10ME74 ‘Seventh Semester B.E. Degree Examination, June/July 2015 Operations Research ‘Time: 3 hes. erry Se Note: 1. Answer any FIVE ful questions, selecting ‘atleast TWO questions from each part. 2. Use of statstteal tables is permited. * = : Listen riety explain be vos piss OA. aay and ste inns of models = ‘omens 'b, The X¥Z Company hasbeen a producer of eletronic cits fa Televkion sets and ceiain| pated cient boarls for Radios. The company hat ‘o expand iat fll sale ‘and marketing of AM and AM - FM. as built new plant hat can peat 48 hours per week. Production ofan AM raQ the new plant wil equi 2 hous ‘Sd production of AM. FM radio wl equi 3 hou: Fach AM radio will ctu Rs 40 fo prott while an AM. FM radio will fadibute Rs 80 to probs. The mauketing ‘purine ter extensive researc, has deine that a maximim 315 AM aio, and TOAM- FM radioe canbe sold each week, Formulate a LP. mode io deri te ota! production mix of AM and AM ~ FM radios that will maximize profs and solve the problem sing Graphical method. ones ine Da poem towing Pl oben Min Z= 2e,~ Se2—259 Sebjet 3 Ioat 2x1 4092) 4a 3x be ‘jer 0 and nis untested. ontaty , Ure BIG Mimedhod to solve the following LPP MinZ= 2x82 Subject 3x14 2-3 anit 326 nyt 2es3 SP ym2 0. dena) & 4. The onner of a machine shop has four machines avaiable 10 assign the jsf Be a. Five Jobe ate offered with the expected profit in & for each machine on ca ab follose Fund the assignment ofthe machines 1 the jobs that wil sult im & mame) profit, which job w be declined. — = 0 [00 apart seme 7 aban [7 ingots C=, Solve the following Traveling Salesman problem wien bY the ROWE Soy wae Fee ee ane Tei gc Osc 6,cu~ 20 wh CH= CH sitchen te an eben ie lala BELGE ialb ee ‘Solve the following LP.P. _ ing peoblern. (96 Marks) ee A tape a PART-B ast eee a dint ind Gor pan se Aye lcjo Tele [ela [i Prece = TA TATB.C)AID,E|C{FLG[H “ig [1 [ES SSS aS] [5 oT Ta TTA eT eobststststetrterereret st |), Draw project wok, dei the crcl path and its expected ronan vin. 1) What the probabiljyafcompleing the project ia 30 dy schedletine? 3) Wit die tas ches thong me omens) ofthe Queuing system and clasiestin of qouing modes (A LEE notations. co [Amita suqgflephone booth reconsidered 10 be Poison distibto tan average ime oe arival and the net. The length ofthe pone calls dstured ‘xponentaly with amean of min Deter 1) "Bapected faction ofthe day tat the phone wil be in use i) Expctd miter of| his the queue i) What the probaly that en arial wil vet wit nore han Gin in queue fr service? fh) Whats the probability tht nore tan Suis ae inte gute? ‘centr Define and rf exp he lowing ts wih eet 19 GAME ey D'oargiatsey i) SADDLEFONT. i) VALUEOF GAME.) Two PERSON ZERO SUM GAME _v)_ PAYOFF. (aon) Solve the following TWO PERSON ZERO SUM GAME by GraphcalMetiod. B ana) Taw artsts to Tt zie Latrté BT a =2 ' , neat bibl edenbebuedondlecldhlaeeteane 1oME74 ‘eMart nn» Be a ir 10 + the job oa 3 int ne oe” oman x ‘Mache e[s[r 101 {84 Whenpusing is ot allowed, solve he lowing problem giving a opti oicn. 1, Find he sequence that minimized te wal tine ‘machines nthe ower CBA. Toa [a [BTC] + gDe mt SIMNOSH £ ooo vss Pele folfele [3] me ne be ODD 10ME74 ‘Seventh Semester B.E. Degree Examination, Dee-2013/Jan.2014 Operations Research "Note: Answer FIVE full questions, selecting ‘at Teast TWO questions from each par. eee iy xen nam es Se. Ba Et, pron ha oly Re 2000 to send bene Accs bow any of each kindof ns shuld te my? eet PART—A | 1a Offa can te troup at Rs 50 ach ad oun hens cn be ‘ a Ms {ens formule the problem aLPPmosel b. Sohethe flowingLPPby Gaphialmeted, —c)\ paeesee i . sibjento consis, “75, e Se, 4x, £200 %, . casi ‘a, Se, de, 2100, SAN fod, 240 hay . Soha ing wing Si ny Zesin 5m <2 Sifjectio consis, xese, 31006 Sej42x, 580° Bio ag bieh © Sh eee ing Bi. Type lt og so A, | me 42x, =10 5x, +24, 210 Qo hx, 20 3a ode tis agen ss Ey Siig HE omens) omens) omen)10ME74 3b A-AML company has 5 tasks and 5 persons 19 ‘nd to mize the total cost. Perform, Determine the optimal assignment cet sobs Fac [OTE reste gtr tstist ste s %, era tes ca 2 rit tete : Le. rete & a4 ing salesman has to vis 5 cis. He wishes to stat fom a artioulg’ohy, vie Pigpetnienen sang yo ind cane UM ck %, AB COE ag. at wus ot % es Pete e, ee web l® eo ola he eb ef ie 7 wnat ine Wy cded aac eran bund ie, eg Marks) 54 Tie blowing ube shes KEAREAD, censusion pet td ter rtd fe Ta Te Tse tala Toles SE @ Eat co ee » Dawa 1 Catala ibe on 3) Find etal ath 25 ina ee cba ta the project willbe competed within Soars c4 Mar) 0 eee Norale i) Castine i) Peat en i Puestatery i) Mica ste”, man ta fide optimum sages fx oth he pe Fair se dominance Bi Br Bs Be Bs Be, Aretha gee h ad «semanas 1 i a 20f3ww (TT TI Seventh Semester B.E. Degree Examination, June/July 2013 Operations Research SG: 3 he Max meets FM OE Notet1. Answer FIVE full questions, selecdng + Ma sy 4 teat 70 questions from ech pre wo FP a 2. Uae gnomel ribton eetpemiea SB ye, aaa nt 6- he mt pase ofopmaions ote See Mohan Gye, tn fro otling pln, one feted at land other st ean Xue odors tre itt A,B tnd © ypce of tts protic Porday we wie x eens = | 5 ~ € On, sole a 3 Neome B309m 4000 “rigs serena Nie EE a ccezment ! ‘Aa0000 bows of B and 4400Qgues of type C. The opraing conn for pt at scare eee ececcne See ees eases Spee i Noinsa 2 nertn, sam tS 5; x 7 TTT dag ns Oph os Mari g 2a soblielowing LPP by Big" metod: in Rube, 254122 nein 8x, 4 amine) 520,520 Solve the following LPP by Dual-Simplex method: Minnie, 2= 4% Sie, 2-824 nit? 20,820 4 1of3osmers ° tnt the optimum sotution to following anspor i ton problem in which the call contain Wy We Ws Supply 0 3, 7_|8_]30 5 = . 3 ‘Sisportation costs in rupees. ws @oMers) ebP rls 1 a Wimissevice di fb Manistee dng wom mod oie Seen ai 5 9 ae ment aon Oy ; re gg ee eS “Sf, average time between (Wo, 2 5‘ wn distribution. Average service emo attendants 40 Zs ing time of Sean wating tie of an aval who ‘een tl the ink 2 ae att ee the come ke written ms re even activities as blo iy en cir [24 [os lsab os s7er7s) pee Lo 16 13 sie 2 sd, petwork i) Fil TLS Lm or aT Sr tnd fee floats iv) identify ent amen) 20f3O6ME74 ' oe ee Sh ERT eh mm Oe ey RS tae shen ‘critical path. What is the probability that project will be completed onthe scheduled date? = (@B Mark) %, oo %, ww Vey Fig. Q6 (b) 7 a Define Spye seatey i) Mixed seategy it) Two penon zy game. os may nets te feng eae by domisacs propery an os (@6Marky « (smarts (oo mart) sa v Maximize, 3x Subject to, GRY 5K, $25 z ico gama QP sn aise a : s 30f3 = TSE TToDd ‘USN 06ME74 ‘Seventh Semester B.E. Degree Examination, December 2012 Operation Research Time: 3 br Max Mi Note: Answer FIVE full questions, selecting iad ‘at least TWO questions from each part PART-A 1a. Define operation research. Lis the various phases of operation research. Ma b, Discuss the areas of management where operation research ecigues are applied “ Marks = Tanamms onc any hs ec pm ope an etre ec proces of which he npn ouplsper posse an alow input Process [Crude A | Grade ‘Gasilne X | Gasoline Y [os 3. 5 5 2_[—s—[—3 4 r ‘The maximum amounis avalable of erade A and Bare 200 and 150 units respectively. Market requirement show that a last 100 unts of gasoline X and 80 unis of geoline ¥ rust be produced. The profit per production run from procs 1 and process 2 ae RS.3 and Sat respectively, Formulate the problem as LP model. (aoMars) ‘7 a. Obtain the dual of the LP problem. Minimize Z= x +%2*% Subject to x; — 3x2 + 4xs: xj-28253 2xn-x24 4, 3220 and xy is unrestricted. (smarts . b. Solve the LPP by using simplex method iy vs nesmen eas ones ——— [ABC limited has three production shops supplying a prod production varies from shop to shop, cost of transportaticn from sho aries. Each shop has a specifi production capacity of each warehouse frequent Phe co of angportation ae given belo fremuime ‘Shop Warehouse ‘Capacity | Cost for production conf v abe peer ts 7 $—Htetratt 5 16 eB te rs tet s 15 Regavement [60] w0 [8510570 : _ Find the optimum quantity to be suppl fiom each soop 1 diferent waren Sinmun al con — bette ty: (eer . 2 oases oi ae cee ee ‘& We have five jobs each of which must go through to machines A.B and inthe order ABC. Job murmber Wachine A Machine B Machine C Determine a sequence or the obs that wil minimize the total cpsd tine en idl tine cach mchine. ome) PART-B 5 a What is queue discipline and ist the various queue discipline? smc) ‘b Ar-what average rate musta cleck ata supermarket work in oder to ensure «probability of {0.0 tat he customer wil not have to wat longer than 12 mints? tisassumed tht there aly one counter to which custome arrive in «poisson fshion at an average rae of 15 ‘The ength of service by the clerk has an exponenial distribution, (07 Marts ce Inahairdres by saloon with one barber, the custome rival fellows poison dsr © an srerage rate of ne every 45 minutes. The sevice time is exroentialy dsbted wih mean of 30 minutes. Find: 3) Average number ofeustomersin saloon, i) ‘Average waiting time ofa customer before sevice. 2 ii) Average idle time of barber. « Define: ') Critical activity and critical path. ii) Total flost. smart) iit) Free float. 20f306ME74 1 AnR and D activity has 7 activites for which the tree time eatinats are given teow lo ‘with its preceding activity. Lee! me ‘ativity | Preceding atv] Opimite | Moat Wkly | Pestimiis ime) | time (ay | time () x 5 7 “s 3 x 6 i rr £ A e 18 4 D B 3 5 ? E c io ie if Z A Ss 7 3 G BEF = io a 9) Draw PERT network i) Find EST, LST and slack for cach node. iil) Find cial path and expected project duration (aracisy 7 a Define: ‘Fai game and saddle point i) Puestratey. ii) Mined srteay. ana ‘Following i the pay-off matic for player A Player 24384] 56378] lense a sea i ‘Using dominance properties, obtain the optimum strategies for both the player ‘eteine the value of be game wane Sa &Sofethe flowing gue epbslly with payoff matic of Agena BB ate atote payed SETS abst osm) Jain zro-one integer programming. Soh the following near preparing by Gomory tesaiau: | Maxinize Zn +x, Subject to 2x) +12 eneee assent) xix 20 and integers. _— © appt nem TRE me i