Scribd Logo
Upload

Welcome to Scribd!

  • Sem 7 OR 5

    Uploaded by

    Rahul Shah
    7 views15 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    7 views15 pages

    Sem 7 OR 5

    Uploaded by

    Rahul Shah

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 15
    IIT] semyr 3 Hours Dec 201 9 OR po Resea NB: © Querton Do 1 is compulsory empt any th . {Ries to he igh india ms ve quesiony @ Assume Suitable data it (©) Notations cary ual measea Answer any four of the following questions; a)Write the dual of the following Lpp Maximise Z= 43, 425) 781? Subject to , 4% 2x, 22 Mt2x =8 %1 2 S10 Qu ©) Brel exi Males esos ea ‘Total: 80 marks e of an arrival ~ time of ai arrival (worker) who waits, (10) y: Vogel's Approximation Method (VAM) and find al ? Dp mas; Di Supply 50 Nein |S 0 a 10 m 30 40 60 9 8 (aaearr0) 20 18, 8 7 4 Page 1 of 3 DIF9F7C3GEGE62DC420FF76DB7S6EE43 X Paper / Subject Code: 42663 / Operations Research “ ¢ B.6| TTI1SeM VI | choice Base | Operation, Resean, \ | b) Iyengar Bakery keeps stock the daily demand as given here: boss (10) Daily 0 10 20 30 225 ]a0 1 Demand SEES S Probability | 0.01 0.20 ; of 8 popular brand of cake, Previous experience indicate, Consider the following sequence of ran 48,78,19,51,56,77,15,14,68,09 Using this sequence simulate the demand fof: if the owner of the bake; ce Ty decided to average demand for this cake on the basis 6 | r/ Subject Co perations Researc! Paper / Subject Code: 4 pe) yf le: 42663 / Operations Research =0 Solve the following linear program by the dual simplex method: Minimize nT = Ox + 3X2 + SHB + OA Subject to X142x2 + 3x34 X47= 2 “axl + X2- X3 +3X4 X1, x2, x3, x4 3 2/ Page Fhe owner of a chain oF grocer table gives the estimated pro numbers: of crates, Y store has fit at enn Pease [No ofcrates _] 0 1 2 ei 3 4 5 6 ‘The owner iiocs Not want to split the crates among stores, but willi allocations. Find the allocations of erates to stores to maninine ee ae ieee! G_[seolve any Two Questions out of Three Oars each Find the optimal transportation plan. Destinati Sources []—7 se =| Supply a A 3 [4 [2 [3 |7 [80 B 6 |3 [4 [5 [6 [60 ic 4 |6 |7 [4 [3 [40 D 3 [5 [5 [6 [4 [20 Demand | 60 | 60 | 30 | 40 | 10 | Total 200 A company is engaged in manufacturing different types of equipment for various consumers. The company has two assembly lines to produce its product. The processing time for each of the assembly lines is regarded as random variable and is described by the following distributions: Processing time in min ‘Assembly X Assembly Y_ 40 0.10 0.20 B rr) 0.15 0.40 aa 0.40 0.20 es 0.10 O15 (0.05 a 22 he processing times for the 10 Using the following random numbers, generate data omy i pcs a ed Units of the product and compute the expected processing average ii f ime. 3/ Page es re] 1 fa processing time on assembly X an the} ae 2021 OR numbers horizontal taking the first two digits fo ‘the | ast two dig Aigits for processing time on assembly Y. | _—_—_______ | —Tan Owner of car service station on h e nes ighway uurchases Rs 40 pore, He needs 0 cars eve purchases cans oF engine olathe ate of n per day. The shorta lay. The holding cost ca Rs.2 percan per day. The shortage costis Rs.10 percan pec de a ee exited to cost is RS.1000 per onder. Decide minimum ener pay eet say: The ordering and other ir Fis uM cos maximum level of inventory? UM Cost procurement quantity. What is the Sketch the i ¢ inventory syste estimated system cost and reorder point It ead time er Also find optimal total ad time is 2 da lays. TSove any TWo Questions out of Three 10 marks mF 7 5 meee Reduce the following game using Principle of dominance 7d a determine optimal strategies for A and B. Find value of game Or eee . pelm|iY20] Y3._| v4 Xi 20 iv 8 6 A Pxoma I 44 [1s [10 X3 13 9 19 iz x4 [9 8 4 [A Four different jobs are to be processed on four different machine. The machining cost associated with jobs and machine combination is given in the following table. Please provide optimal allocation of jobs on machines so that the total cost of processing is minimum. An asterisk represents restricted allocation. . Jobs/Machines [M1_[M2_ [M3 [Ma i 6 mea 7 Aes 9 10 id, B 5 nm [8 | 4 i 9 (4 a] 20] a] oe! is. One counter handles withdrawals of value ve 1000 and above. Analysis of service ‘A bank has two counters for withdrawal: less than 1000 rupees and the other counter abo ’ : time shows an exponential distribution ‘with mean service time of 6 minutes per customer for each counter. Arrival of customers follow Poisson distribution with mean 8 per hour for the first counter and 5 per hour for the second counter. i) What are the average waiting times per customer of each counter? ; ii) teach counter could handle all withdrawals irrespective of their value, how would the average waiting time change? 4|Page NB. (1) Question No 1 is Compulsory, 8. able data,if required vind state clearly, Ql Attempt any FOUR. x - KS 1 2 4 | 33} 00] | a} en lar item ha a demand of 8,000 units/year. The cost of one procurement [10] and the holding cost per unit is Rs.2.6 per year. The replacement is instafitaneous arid no shortages are allowed, Determine- Page 10f3, 082F 12BDSDF7FC9F24086ADAE8217953, rape , e z: ; jy The economic lot sit ‘ oi ‘The number of orders ible : ; ime between OF g wR < a he tl 06st per year if theeost of one tnit is Rs:t-5. . ‘ Jrines and four tasks FOF completidn, Fae, . Bac ine shop suf visor has four mac} ; » Amtinapeenich rine eo S an aks is given in themarix Belg __<° Qa 38: ay 42 jo minimize total time required Tor processing TNS How shouli the taskebe assigned t Se es d Ata ooking widdow custotners arrive-at the rate of 10 per: to Poison's distibution. If service time is exponentially x oy inute approximated uted with amean of"! 1S perminut® determine- & {@ Probability that the booking:élerk waitsfor the customer, _-) > (b) Probability that there are atleast 3 customers in‘ the queue; * ¥ (©) Average number cae in system, . ' (@ Average time spent int ie queues. 9 < (q Probability that the customer i ithin four niinutes. a tq 9 _O Txt 12382 ae < ~ x12 80 & Sy : ‘ ‘ $ S LY S Y v Y eS & &'b A sufacturs around 260mopeds De ; A gions) aaa popes reps one availability [10] oh 7 ly production has been varyin . m 196 mopeds 204 — ‘whose pibbability distribution is as en = > < : Ao Pro a 5S] 198 [U9 yaaa] aor p02 7205] 2" < — VProbabitig 0.05 F105 SC ens 1909 [oz] 0.14 £0.20 [ors [ort [0.08 [0.06 The finished mopeds are tranipo Ss The fined mopeds pe al ina Specially designed three-storeyed lorry nsiodate moped. Using the following 15 random ot 8:88; 04,23, 30, 77,27, $4 and 1, simulate the average number of m mopeds waiting in ae ear, spaces in the cea oa Page 2 of 3 Paper / Subject Code: 42183 / Operiitions Research Q6 a A firm has divided its marketing area into three zones. The amount of sales depends upon the number of salesmen in each zine. ‘The firm has been collecting the data regarding sales and salesmen in each. area over a number of past years. The information is summarized jn table below. For the next yearsfirm has,only 9 salesmen and the problem is to allocate those salesmen to three different zones 80 that the total sales are maximum, r e 3 i cn ihousands offupees . — Profits nth ee ~ Zonet | Xone 2 Lone 3 , 0 35 ae | ? 1 45 Le Ra 38. 5 60 35 S64 70 5 ae 582 ans 82 93 ae oma Es 3 ¢ = Tan p 8S 100 of 10 4 3 a too 2 SH0 ~ 7 x i Sees Explain the principle of dominance and hence solve the following game: [10] Player B 1 iz 2 r 1 8 5 8 & “ Player A i 8 6 5 TL im 4 § ~ IV 6 5 6 2 Page 1 of 3 /_ FD4AAC988F909152C4184861818C03A1 rs/6 [2 ae ; Paper / Subject Code: 42685 / Operations Research 3. a Find the basic feasible solu th slution of the following transportation problem by North- [10] west Comer Rule, Also find the optimal transportation plan I 2 3 4 ‘3__|_ Available A 7 6 4 Suan EES) 40 B 8 5 6 fl 8 30 © 6 9 6 5 20 D 5 7 7 8 6 10 Required 30 30. 15 20 2 100(Total) b A particular item has a demand of 8,000 units/year, The cost of one procurement [10] is Rs.150 and the holding cost per unit is R5.2.6 per year. The replacement is instantaneous and no shortages are allowed. Determine- (i) The economic tot size, The number of orders per year, iii) The time between orders, (iv) The total cost per year if the cost of one unit is Rs.1.5. 4 a Atmachine shop supervisor has four machines and four tasks for completion. Each [10] of the machines can perform each of the four tasks. Time taken at each of the machines to complete the tasks'is given in the matrix below= Tasks Machines z Mi Ma Ma Ma > 1 31 62 29 a2. 3 pI 12, 19k 39 35, 3 17. 29. 50 41 4 35 40 38 42 How should the tasks be assigned to minimize total time required for processing? b- Ata booking window customers arrive at the rate of 10 per minute approximated [10] to Poison's distribution, If service time is exponentially distributed with a mean of 15 per minute, determine- ity that the booking clerk waits for the customer, (b) Probability that there are at least 3 customers in the queue, (c) Average number of customers in system, (@) Average time spent in the queue, (©) Probability that the customer is served within four minutes. < “g < a Solve the following L.P.P. by Big-M method- [10) Maximize z= 12x1 + 20x Subject to : 6xi-+ 8x2> 100 Tait 12x22 120 x1X22 0. Page 2 of 3 FD4AAC988F909152C4184861818C03A1 Paper / Subject Code: 42685 / Operations Research b A company manufactures around 200mopeds. Depending upon the availability (10) of raw materials and other conditions, the daily production has been varying Bon 196 mopeds to 204 mopeds, whose probability distribution is as given low- Production ] 196 [197 [198 | 199 [200 [201 |202-] 203 | 204 0.05 | 0.09 [0.12 [0.14 [0.20 [0.15 [0.11 | 0.08 | 0.06 The finished mopeds are transported in a specially designed three-storeyed lorry that can accommodate only 200 mopeds, Using the following 15 random numbers 82, 89, 78, 24, 53, 61, 18, 45, 04, 23, 50, 77, 27, 54 and 10, simulate the process to find out- (i What will be the average number of mopeds waiting in the factory? (ii) What will be the number of empty spaces in the lorry? 6 a A firm‘has divided its marketing area into three zones. The amount of sales [10] upon the number of salesmen in each zone. The firm has been collecting ite regarding sales.and salesmen in each area over a number of past years. information is summarized in table below. For the next year firm has only 9 ~ salesmen and the problem is to allocate these salesmen to three different zones so ~~ that the'total sales are maximum. = AS ° a RS Profits in thousands of rupees Sil ae Zonel~

    You might also like