sso as X niversity of Science and Technolog, Department 0 Of Mechanical and Production Enginect 3 3¥ear i" “Semester Final Examination {Fall 2016) | Grmediate. Industrial and Produetiorr engineering Course Title: Operating: Researeh Tiave: 3 (hrec) hours Full Marks: 70 | Instruction: Standard Normal ‘able is to be supplied Shere are 8 (eight) questions and answer any 6 (six). Questions are of equal value. Marks allotted are judicated in the right margin, owing LP Puoblem. Al X20. %2 04X20 The optimum solution is: 10. $05 30,40 50 (1) What is meant by dual variable? Show with en example how you would calculate the salue of 2 dual variable graphically. a ) Write down the dua forthe following problem: Se | Maximize Xg= X.4 2Xa-3%s #4Xe 4 Xy-3X_ #5 6X4 1Xy- 3Xy 5K 28 12M, OX +9%s 49X4 520 X12 8, X26, X20 X, is unrestricted in sign ithe fllosing sofions.graphicctty as (h) How can you ideser related to simplex method to identify an entering (2) a entation problem related to simplex method to identify n t vate 2 “ppeosnivts problem? Ifow would yous a) a follow of assigning five operators to five machines, The (8) far ieee eee ave 1 3 4 5 a) i 2 o [R22 2 4 2 3 § [Pe 2 9 3 5 3 IR=3 fee 2 6 2 [Ree 5 6 5 7 9 j eee Oper 1 cant 3. Also Operator -3 cannon be assigned 10 ain saddle point, maximin and minimax criteria and wy Aeferrng w Gare theory, ni Solse 0) ving problem praphicallyMoan dowel Mostikely oy, te ¢ i ) Let 3-5-6 © @) (ay Draw th tor digra and ietify ec ical path, (b) How iste ctl atv identified? Explain it from the example (eSateutt te probability tat ihe projectduraion wl be atleast 20 uritsoftime? One2 56 LE, 2/4 2 6Ahhe owner of ~~ arawberries. The est pefore spoilage differ among three stores. Therefore th Should allocate the tive erates 10 the three stores (0 Minnis reasons, the owner oes ot wish o split cates between: stores, Howe ser Fe fwling to cisibue zero crates to any of his stores. The Following table ives th expected profit at eachstre when ti allocated the given mimber of ere : a ofmin of three grocery slores has purchased five Sesh itd sied probability distribution of potentia} sales of the strawberries oe wishes to know haw he he expected profit. ForUse dynamic programming to determine how many of the five erates should be assigned to each ofthe three stores to maximize the total expected profit. 1. A service station has one gasoline pump. Cars wanting gasoline arrive according to a Poisswin piucess at a mean rate of 12 per hour, However , if the pump already is being sed, these potential custersers may drive to another service station, In particular, #f there ate n cars already at the service station , the probability that an arriving customer will go to another service station is r/4 for n=1, 2, 3, 4. The time required to service a car has an exponential distribution with a mean of S mimates. (i) Construct the rate diagram for above system. ie (ii) Develop the belance equations ) (ii) Find steedy- state probability distribution of the number of cars atthe station, @) {iv) Find the expected waiting time including service for those cars that would stay. e 8,0) Whatis Markov chain ? “In Markov approach, the behavior of the system must be @ characterized by lack of memory and the process must be stationary” ~ Explain the ~ statement ] Consider the following 3- state system and the transition probaitities. Evaluate the (73 limiting (steady-state) probabilities and comment on the system. 31, lanl ‘Theorems - zi 0 | 5000 S398 $793 | 179 4 | 6534 5 | 6915 6 | 7257 1) 7560 8 | 78a 9 | 8159 1.0 | 8413 Ll | 8643 12 | 8849 1.3 | 9032 14 | 9192 5040 5438 5832 627 6591 6950 791 78} TIO $186 8438 8665 8869 9049 9207 9345 9463 9564 9719 S080 SA78 5871 6255 6628 6985 7324 7642 7939 8212 8461 8686 8888 9066 9222 9357 9474 9573 9636 9726 9783, 9830 5868 9898 9922 9941 9956 9967 9976 5982 9987 9991 9994 9995 9997 5120 5910 6293 6664 7019 7357 1673 1967 8238 8485 8708 8907 9082 9236 9370 9484 ~ 9982 9664 9788 9834 9871 9901 9925 9943 9957 9968 9977 9983. 9988 9991 9994 9996 9997 7054 7389 7704 7995 8264 8508 8729 8925 9099 9251 9382 9495 9391 9671 9738 9793 9838 9875 9904 9927 9945 9959 9969 9977 9984 9988 9992 9994 9996 9997 5239 5636 6026 606 6772 7123 7454 764 4051 8315 8554 8770 8962 9131 9219 9406 9515 9608 9686 9750 9803 9846 9881 9909 9931 9948 9961 9971 9979 9985, 9989 9992 9994 9996 08 09 SH .5359 SIl4 5753 61936141 64806517 68446879 7190 .7224 517.7549 7823. .7852 8106 .8133 83658389 8599 8621 8810-8830 8997 9015 91629177 9306 9319 9429 9441 9535 9545 9625 9633 9699-9706 97619767 Gin 9877 98549857 9887 9890 99139916 99349936 9951.95? 9963.99. 99739974 980.9981 9986. _.9986 9990 9990 993.9993 99959995 9996 9997 99079ring pring 2016) duction Engineering Coarse Title: Operations Research Full Marks: 70 ation] | t---—jalgorithm to select an entering variable a of What is an assignment model? Show that solution of the “2 Q Sol cost minisiwin method, ej Supply - i 72] 3600 j i - Source I | oo solution to this HE your answer is wise find out the sofutjon t ze ® neracy in a transportation problem? How do you ) What similari tween. simplex method and you find het 2} gment mode! 7 remains seme if a constant is added or subtraced to any row or column of the Va cost matrix. e Solve the following assignment probleme L Machine exaniglesF BI socalled? lity that the projeet duration will be a Jeast 22 units of [32] Fi he critical activit (0) - Cateutate the probut time, ne calls ata telephone booth is according to poisson [64 we time of 9 minutes between two consecutive — 3 of telephone ¢ be exponentially (thie) minutes. he probability that a person ar have to wait, if} What isthe average queue fength that forms from time to time? iii) Find the fraction of s day that the telephone will not be in ws. to) Consider a servive system consisting of two sewers A and B. Arriving {5} customers will only enter the system if server A is free and he is immediately. served by server A. When his service by A is completed, he goes to B if B is tice or, if B is busy he leaves the system, Assume (poisson) arrival rate of two i sential) His assmmed & ig at the booth will raspectively (3) Draw th othe abjectise i anima Gangdhissane added to that team. The two additional scientists (0 ¢ teams will be successful .e two important properties of [4] stochastic process pple to each, plain with an example what you mean by steady-state probability? fie Calculate the steady-state probabilities associated with the following 3-state em, Hints first, write down the stochastic transitional probability maérix & j awso Date: 22/03/2016 Absanullah University of Seience and Technology ‘Department of Mecha and Production Engineering Program: B. Se. iy Industrial and Production Engineering 3° Year "Semester Final Exarsivation (Fall 2015) Course No (PE HUT Course Title: Operations Research ‘Timer 3 ({hree) hours Full Marks: 70 nswer any Si(five) questions. gin indicate full marks. standard data if needed) “There are seven) questions. Al The igoresin he right ma sual meaning, Assume any (Senp ‘Normal tuble i to be supplied) 1, Consider the fllowig | P pioblem, Maxi 2X AX Subjeato Apart inernedite slain of the above problem is given in the 4 _ Complete stove ey alta optim? Wh @) epsimut, find ou the optimum soutin, a a2. (a) By using ost minimur. method, solve the tran 4 on problem having (9) ‘hefollowing cost mati. 3 ‘4 (t) Howisthetrnsptation agoriti rlated to simples method ta identify (3) 1. Anenteing variable and IL Analtervative solution, (0) Whats dgenercy na transportation problem’ Llow do you sesolve i? Q ‘oolege suet as seven dys remaining bere final eaminations begin (14) inhefourccuresand she want allocate this su ine as effectively as weeds at Ieast 1 day on cach course and she tikes to pile, Sh concentrate on jest me couse c3C) gis: so she wants wy allocate 1.2.3 ar Ss iheseallocaionstog 3 courses, Ske yieldthe “< i 2 ; soos 3 6 6 g it i 79 9 Used raring i : xe ke dynamic peptone We Hus as (e) A repute nan iste DE hited to Fepsin mechines: which break down oa hi aes i pr Hace he Bicol dos, lls Poison, ia aw iam pdicice he cE5. (a) Explain an % rand he services hr. The fast repaicman demands TK of 12! he, Whish repairman should o. The low eepeinnsn changes TK 16) st but expen Draken dova inechines at the rate 20ihe and he services an average be birt? ; (0) Consider tvo fetig | and 2. A customer upon arrival goes initially to (6) fecili.1 whew be peforms his first task. Afler this is done he gots to xis performed. The seavice tiniest v0 facies buted with respective rate py and 4. IF potential ita exponential rate 2, andi if a potential i sm if both facilities are emply, then what n? The first identify the states, write are exponentially dist customers are assume (0 att customer will only enfor the proporion of cestomer enter the system the balance equetinsand then proceed, Assume jy =H 1,2 =2. assigiment model, How is it basically different from a (8) ‘The optimal solution uf an assignment model remains transpoation the sume if costa is added subtracted f0 any row cr eolunan of the cost nts. Expeinvth example ’ 7 7 6 9 “EE Foie, cpentoe! 3 and operatore3 * amt be assigned W mnachine-4, For these two eases, in the aby a vais, pu N fe sey big umber} and then proceed the epsimat fy eatin6 (a) Referig tg plain de following terms with examples: (s) Minimax{meximia) 1 ale pon and TL Hixed stateg ops fllowieg game problem: CI | Wa the any cial sctivity and show that its (3)Date, 22/04/2015 Absanullah University of Science and Technology Department of ‘Mechanical and Production Engineering Program: B.S in Industrial and Production Engineering 3"'Year "Semester Final Examination (Fall 2014) Course No: 1PE 3107 Course Title: Operations Research (three) hours Bull Marks: 70 \> ‘Meare (Seven) Questions. Answer any 5 (Five) Questions. Toe figures inthe margin indi (full marks. Standard Normal table is o be supplied. 1.) Show that the dual variable corresponding to a primal constraint having equality in sign ‘must be unrestricted i sign, @) (6) Consider the following LP model, Maximize Xq= 3X; + 2Xy Subjectio —4Xy+3X) <1 AX tN <8 AXt-Xr <8 Xi, % 20 re ‘The base variables ofthe optimal solution of the model ace piven in the follow ing table. 2 ©) aa Q) BART prievity (2) pyed to simplex method to find an alternative 1 soluticn? / @ ' % «(Muti degeneracy in a tanspottion problem? How do you esolve Oy 3,(grConsier the following problem of assigning four operators to four machines. The Figures ‘yl tothe corresponding assignment cost. Operator-1 cannot be assigned to machine-3. Also (1) (6 How is the transportation algorithm relat operator} cannot be assigned to machine-4, Find the optimal assignment Machine Operator aune (6) The optimal solution of the assignment model remains the same if @ constant is added or subtracted to any row or column of the cost matrix, Explain the statement (Oo) 4, Suppose for solving an engineering problem, vee research teams are currently trying. The estimate has been made thet, under present circumstances, the probability that the respective teams. call them 1, 2, and 3- will not succeed is 0.8, 0.6, and 0.4 respectively. Becausse the abjectve isto minimize the probability of failure, two more top scientists have been assigned ‘otheproject. The following table gives the estimated probability that the respective tearesé will fail when 0, 1 or 2 additional scientists are added to that team, The problem is to determine how to allocate the two additional scientists to’minimize the probability that all three: teams ny vie - 18) of Numin addition to the one being storage space will be adequate to @ ‘Mostly Ge | PSRG 5 TRA ES the critical path. Why are th e above project cennot NF Mite short neies Maxinvin and minines x critesis in Geme theory (expla Kinceo an atificial varie 4Ahsanuflah Uniy ty of Science ard Techno! Finul Examination of Spring Semester 2015 artment of Mechanical and Production Engineering Program: BS Dep ¢. iu Industria and Production Engineering 3° year 1" semester 07 Course Title: Operations Resear: Time: 03 (three) hours Full Ma rmal table is to be supplied There are 7 (seven) questions. Answer any S (five). Marks allotted are indicated in the margin. 48+ 43, Consi + the Following LP problem: 3x42x) 5) s 2)4 @) How is the traspetstion algorithm elated to simplex mated vw centering variable? ‘ow do you identify thatthe problem has an alternative solution? ina transportation problem? How do you resol (@) Whats degeneracy nment prublent (@ Solve the follow Give the Theory behind the Procedure you have used. nd mixed strategies. (b) Refereeing to Game Theory, explain saddle point Solve the following problem graphically: four courses, and she Watts to seis tne effectively as possible. “needs at least one day on e2ch coum cand-ahe Tikes to co n just one course each day; so she wants to allocate 1, 2, 3 Dusan pogrananing o make te loca be obtained from four courses. She estimates that the alrer ‘0 each course. Useioe work of the above activities and identity the critical path. Why ical path so called? HetHate the Probability thatthe project duran will be at least 22 units of time, 6 (@) Arrival mate of telephone calls at a telephone booth is according to Poisson 2424 distribution, with an average of 9 minutes between two consecutive arrival 2 length of telephone call is assumed to be exponentially distributed with mean 2 nines, i, Determine the probabifity that a person arriving at the booth wait. fi, Find the average quene length that formas fem time to tha iii, Find the fraction of a day that the phone will be in use Q (B)_ Consider a sequential service system consisting of two servers, A anc B. J nae customers will ovly enter this system if server A is free. If @ customer 22 then he is immediately served by server A. When his s tomers at hour : (Poisson) arrival rate is two custon (exponential) rates of 4 and two cu i. What propostion of customers enter the system? What proportion of entering customers receive service from 3? : if, What is the average wanouat of time that an entering customer spends inthe system? ix, What is the average number of customers in the system?b) Whotis Big-M¥ (©) With an example, explain the ¢ (@) the priaal cchique in finear programming- aint has equality in sign, a sign- explain with an example. Explain property in Game eary ing duel variaTheanuilah t . aaulth Caiversity Ol Mecha 3” Year ("Semester Fi Poogram: Industrial and Production Enginee ing Course Tite [Spring 281%, Iperations Research | Full Marks: 10 suction: Standard Netinal Table is fo be supplied }questins and ansuver any 5 (five). Questions sre ) qu Marks allotted are indicated in the right margin ual wave Q1 Consider te following £P Problem Complete the abov Isthissoluton optimum? Why? Ifthe solution is NOT.oftimum, find out the optimum. solution 6) Solve the tr snisimursSupal 200 250 9 {300 0 100 Demaid 150 300 (b) How is the transportation slgcrithm related io simplex method to identify ax (meximin) criterion Saddle paint Gil) Mixed strategies (8) Solvethefollowinggames graphically: yt erties, The esi ach store when it ge dir among the thee stores. The 2, explain the foilowing ermis with examples: For administrative reasons, the owner does not wish (o split crates between stores but is willing 10 make zero allocati Find the allocations of five awberries gives the located various number of fi)2 16/8/2014 Absanullah University of Science and Technology Department Of Mechanical and Production engineerin 3" Year t" Somester Binal tvamination (Spring 2014) Program: fndustriskand Production Rapincc ing CourseNosIPE3I07 Course Tite Operations Research = She) ours Special Instucion: Standard Normal Table is o be supplied. Thereare 7 (seven quesans and answec any 5 (Five). Questiousace of equal vale. Mash totied are incicated in the right margin. Qu Consider the following LP Problem, Maximize X92 Xy+2Xy+ 5X, subjectto “XEN, S40 Xt #2%) $460 XAG <4a0) i i i i { - 4] £ fi) Commplebeahove table is : (i) Iethiseo Gil) Wie a JfBer tone fer to yaleDest ion 2_ 54 Supply ‘2 js Piya} 200 Somes 2/1 to 6 It [280 3{o J [1s 9} 300 Derwed 159 300 200. 100 speration algorithm related to simplex method to identify an (3) ‘Unsporiation problem’? How da you resolve it? o) ‘o gauteeory, explain the following terms with examples: (6) Minirax (maximin) criterion il) Saddle yeint (ii) Mixed sategies {h) Solveths followinggames graphically: B (44) U2 5 6 ae ila 9 i A [i ; 4 ET Q4—Theowner of achin of 3 preeery stores fas purchased five crates of fresh 14] /— swieaes Te sated pebbles ofpoental sles ofthe siavbervies * ifthe three stores, The following table gives the each store when it isallocated various nunber of ili 10 make ze 5 sosiaie the pi* Abe following projec ativties i cisely | Preceding Activity [oe | pecalls ata telephone bevih is according to poisson [7] ne of 9 minutes betiveen two consecutive to he exponeatialty prone call, jn of te (three) minute, probability that ‘ot autiving at the booth will ige queue lengih that formis from time to time’? Find the faction of day that the telepho not be in use, kt a soivice system coy of two servers A and B, Aniving [7]. ners will onlgnter the sytem i server A is ree and be is immediately seaved bysener A. When his sevice by A is completed, he goes to B if B ix “3 fice or, ifB 4s busy he be system. Assume (poisson) arrival yale of .o ‘avo customers an Bove (2) and service rates of A and B (both eyponential) - sesptiely ye 4d y= 2. if (a) Draw the rte ciagam and (b) Write down the balance equations PY & (7 Write shat tes on te follensing (a) Bight techniqre e B) : ) de with sn example 6) ‘ GB): 2f