Midterm Solutions

You might also like

Download as pdf
Download as pdf
You are on page 1of 5
Name/Last name: 2/12/2020 Student ID: INE 3009 OPERATIONS RESEARCH MIDTERM (*#4Show All Work for Full Credit***) 1. (25 pts.) A company manufactures two kinds of vacuum cleaners; one cleaner uses water to Vacuum out the dirt, the other uses air to perform the same task. The company makes $140 profit from the water vacuum cleaner, and $80 profit from the ‘air vacuum cleaner. Both products require a two-step production process on ‘machines | and 2 respectively. To produce one unit of ‘water vacuum cleaner, 6 hours of machine 1, and 3 hours ‘of machine 2 time are required. To produce one unit of air vacuum ‘cleaner, 3 hours of machine 1, and 3 hours of machine 2 time are required, The production capability is such that only 120 hours of machine |, and 90 hours of machine 2 time are available. The company wishes to produce at least 15 water vacuum cleaners and 15 air vacuum cleaners. Formulate this as a Goal Programming problem and obtain a ‘graphical solution for the problem (use the graph provided on the next page). Mint : Constraints kave to be satisfied before we G5 woe voce wale” cle Mow, 40, + 80%, chy Sib. Ot, + 3%. © 12D Bat + D2 £ FO 1, 21 Ryze + r 7 i Min, die da + 5 + de * 2120 bt) + 37ar d, -¢4 Het BM.t dy - dy 240 ae “y+ a3 - 4, 215 af ata 4, -4, 215 Scanned with CamScanner sb +322 > Comer point C > panies . ba 4306) a 190 => }m,=12.5 Bayt Bt + hs o 40 => she s)+309)* 4 >|4)-0, ag = 7 290 Scanned with CamScanner (25 pts.) Seervada Park has recently been set aside for a limited amount of sightseeing and backpack hiking. Cars are not allowed into the park, but there is a narrow, winding road system for trams and for jeeps driven by the park rangers. This road system is shown in Figure below where location Cis the entrance into the park; other letters designate the locations of ranger stations. There is a limit on the number of trams the management can secure on each rond. The numbers on the arcs give the number of trams that can travel on the roads during one hour, ‘The park contains scenic wonder at station 7. Each hour park visitors enter the park, get on the trams and travel through each station and reach station T'to watch the scenic wonder before they exit the park at this station, Park management would like to determine maximum number of trams, carrying sightseers that can be sent from location Oto location 7. (Note: Write down the path for each iteration, NO CREDIT will be given otherwise) Si Yue ext al = 12 ce) DTotei3+1 214 ns pt o \eft over capacity. 4 ‘a--0-1-3, : O-t-8-T-¥ OTHER SOLUTIONS ARE o-c-e-p-t-ly ALSO POSSIBLE. Tot. 13 Scanned with CamScanner 3. (25 pts.) A pharmaceutical manufacturer must supply 30 batches of its new medicati quar en 25, 10, and 35 in successive quarters. Each quarter in which the company makes prod 8 $100,000 setup, plus production cost of $3000 per batch produced. There is no limit on production capacity. Batches can be held in inventory, but the cost is a high $5000 per batch per quarter, and ifa batch is in inventory for more than 2 quarters, the inventory cost increases by 2% (not compounded) cach quartet. The company seeks a minimum total cost production plan. Show a network representation of the problem. coskei_— sahup st m0.002 Danae production : $3009 oS oldieg : #9000 “oO 4 _ 2 0 A’ o9+ (20)3+ (25) 3+(0)3 + (05) 54 (\o)= 920 - oor (23) (3)+ (19)(3)+ (olla)=29 soo+ (25)34 (i0)3+ (85 gla) (35) 1 : 100 4 (6) 3 40) 3+ (35) 3 +(29) 5 (19) 10 + (a5) 19 = 180 Scanned with CamScanner . (25 pts.) Powerco has three electric power plants that supply the needs of four cities. Each power plant can supply the following numbers of kilowatt (kWh) of electricity; plant 1-35 million; plant 2-50 million: plant 3-40 million. The peak power demands in these cities (kWh) are as follows: city 1-45 million, city 2-20 million, city 3-30 million, city 4-30 million. The cost of sending 1 nillion kWh of electricity from plant to city depend on the distance the electricity must travel The shipping costs are shown in the following table. Use the transportation model to minimize the total transportation cost. ****Show only the first iteration**** . “ > Ge ues 2 value To From cityt | city2 | citys | Citys 1 $8 $6 slo 9 Plant 2] $9 $12 S13 7 3] sw $9 $16 $5 Viz? yyeH welt ve! e eo | 499) el a Bar¥aTDve! al 2 90-2 ar eee eyez! mY 215 ey," 12 dee 3 al °f vey etd DY 5 dem, 17 20 30 30 Agr Yar 16 DAH = age ve A Mee Enienng yar; -Je OrieGeo _¢20 ox2-10=2 Ne i exo 79718 ee . Q0+F7 ot 92-8 HH-T=6 10-630 => enlting var’ (3.2) > leaving var { (3,3) z= (35X@)+ (12)(4) +@qU12) +(90)(13) + (io) (16) +60(5) = 090 New z= 160 {10)(9) = ny Scanned with CamScanner

You might also like