数据、模型与决策(运筹学)课后习题和案例答案006.docx

《数据、模型与决策(运筹学)课后习题和案例答案006.docx》由会员分享，可在线阅读，更多相关《数据、模型与决策(运筹学)课后习题和案例答案006.docx（25页珍藏版）》请在课桌文档上搜索。

1、CHAPTER6TRANSPORTATIONANDASSIGNMENTPROBLEMSReVieWQUeStiOnS6.1- 1TheCEOisconcernedaboutescalatingcosts,inparticulartheshippingcostsforpeas.6.1-2KimBakerisbeingaskedtolookatthecurrentshippingplanandseeiftheycandevelopanewonethatwouldreducethetotalshippingcosttoanabsoluteminimum.6.2- 1Transportationpro

2、blemsingeneralareconcernedwithdistributinganycommodityfromanygroupofsupplycenters,calledsources,toanygroupofreceivingcenters,calleddestinations,insuchawayastominimizethetotaldistributioncost.6.2- 2Thedataneededforatransportationproblemarethesupplies,demands,andunitcosts.6.2- 3Formulatingaproblemasat

3、ransportationproblemonlyrequiresfillingoutatableintheformatofTable6.5.6.2- 4Atransportationproblemwillhavefeasiblesolutionsifandonlyifthesumofitssuppliesequalsthesumofitsdemands.6.2- 5Aslongasallitssuppliesanddemandshaveintegervalues,anytransportationproblemwithfeasiblesolutionsisguaranteedtohaveano

4、ptimalsolutionwithintegervaluesforallitsdecisionvariables.6.2- 6Thetransportationsimplexmethodandnetworksimplexmethodcansolvethemfaster.6.3- 1AMinimumandShippedMaximum.6.4- 1Theareasofapplicationinthissectionaredistributingnaturalresources,productionscheduling,designingschoolattendancezones,meetinge

5、nergyneeds,andchoosinganewsitelocation.6.4- 2Minimizethetotalcostofmeetingthewaterneedsofthefourcitiestheyserve.6.4- 3Thesourcesaretheproductionofjetenginesonregulartimeandovertimeineachofthefourmonths.Thedestinationsaretheirinstallationineachofthefourmonths.6.5- 4Distancesplaytheroleofunitcosts.6.4

6、- 5Minimizethetotalcostofmeetingalltheenergyneeds.6.5- 1Thethreekeyfactorsare(1)thecostoftransportingtheoilfromitssourcestoalltherefineries,includingthenewone;(2)thecostoftransportingfinishedproductfromalltherefineries,includingthenewone,tothedistributioncenters;and(3)operatingcostsforthenewrefineri

7、es.6.5- 2Thenewrefinerywillhaveagreatimpactontheoperationoftheentiredistributionsystem,includingdecisionsonhowmuchtoshiptoandfromeachrefinery(newandold).6.6- 3Threetransportationproblemsweresolvedtocomparetotalshippingcostsforcrudeoilwitheachpotentialchoiceofanewrefinerysite,andthreeweresolvedtocomp

8、aretotalshippingcostsforfinishedproductwitheachpotentialchoiceofanewrefinerysite.Thisresultedinsixtotalproblems.6.7- 4Managementmustconsidernon-financialfactorsaswell,suchasclosenesstocorporateheadquartersandwhetherthereareanycosttrendsortrendsinthemarketplacethatmightalterthepictureinthefuture.6.8-

9、 1Givenasetoftaskstobeperformedandasetofassigneesthatareavailabletoperformthesetasks,theproblemistodeterminewhichassigneeshouldbeassignedtoeachtask.6.9- 2(1)Thenumberofassigneesandthenumberoftasksarethesame;(2)eachassigneeistobeassignedtoexactlyonetask;(3)eachtaskistobeperformedbyexactlyoneassignee;

10、(4) thereisacostassociatedwitheachcombinationofanassigneeperformingatask;and(5) theobjectiveistodeterminehowalltheassignmentshouldbemadetominimizethetotalcost.6.6- 3(1)Identifytheassigneesandtasks,and(2)constructacosttablethatgivesthecostassociatedwitheachcombinationofanassigneeperformingatask.6.6-

11、4Whenanassignmentproblemisdescribedasatransportationproblem,thesourcesareassignments,thedestinationsaretasks,andthesuppliesanddemandsareallequalto1.6.7- 5TheHungarianmethodsolvesassignmentproblemswell.6.8- 1Whenformulatingthespreadsheetmodel,aconstraintisincludedintheSolverdialogboxthatsetstheassign

12、ee/taskcombinationequalto0.6.7- 2Ifanassigneewillperformmorethanonetask,thesupplyischangefrom1tothegreateramountthatcanbeperformed.6.7- 3Ifataskwillbeperformedbymorethanoneassignee,thedemandischangedfrom1tothegreateramount.PrObIemS6.1 a)UnitCost($)Destination(RetailOutlet)1234Supply150060040020010So

13、urce220090010030020(Plant)330040020010020420010030020010Demand20101020b)IIIlllIII6.4a)UnitCost($)Destination(DistributionCenter)1234SupplySource150075030045012(Plant)265080040060017340070050055011Demand10101010-L-6.56.76.8WttMI)MiWt硼懒AllowableRangeDestinationSacramentoSaltLakeCityRapidCityAlbuquerqu

14、eSourceBellingham449to492to528570to8516to888EugeneYOto367401to437473to770toAlbertLea267to331to-to472601to1,036Theserangestellmanagementhowmucheachindividualcostcanchangewithoutchangingtheoptimalsolution.IsiCeIIs神（U掘Mta搬怵a) Theoptimalsolutionwouldchangebecausethedecreaseof$30millionisoutsidetheallowa

15、bledecreaseof$20million.b) Theoptimalsolutionwouldremainthesamesincetheallowableincreaseis.c) PercentageofallowabledecreaseforCalorietoSanGo=(230-215)/20=75%.PercentageofallowableincreaseforSacrontoLosDevils=(145-130)/=0%.Sum=75%100%,sobythe100%-ruletheoptimalsolutionwillnotchange.d) Percentageofall

16、owabledecreaseforsupplyatSacron=(0.5/2.5)=20%.PercentageofallowabledecreasefordemandatHollyglass=(0.5/1.5)=33.3%.Sum=53.3%100%,sobythe100%ruleforsimultaneouschanges,theshadowpriceswillremainvalid.6.11-L-2636466.166.17a)TheFeasibleSolutionsPropertyguaranteesthat,sincethesumofthesuppliesandthesumofthe

17、demandsareequal,theproblemwillhavefeasiblesolutions.b) TheIntegerSolutionPropertyguaranteesthat,sincesuppliesanddemandsareintegers,theresultingoptimalsolutionswillbeintegers.SuppliesandDemandsare1,sotheonlypossiblevaluesofvariablesinanoptimalsolutionare0or1.c) Thiscanbeinterpretedasanassignmentprobl

18、emsinceallthesuppliesanddemandsareequalto1.Eachsourceshipsoneunit(theassignee)toonedestination(thetask).e)-1-6.18a)-L-b)-L-6.20a)Thisproblemfitsasanassignmentproblemwithshipsasassigneesandportsasassignments.6.216.22a)Theproblemfitsintotheformatforanassignmentproblemwithswimmersbeingassignedtostrokes

19、.Thetimesoftheswimmersreplacethecostsofatraditionalproblem.6.23CaSeS6.1 C)Ptior)1(ShiPPingbyRail):RaneWNJmCCOllSShipmentQuartl0F1ShippingCostB3:F5TotalAvaiIabIe110:112TotaICost115TotalReceivedB13:F1TotaIShippedG1O:G1TetanllR15:FlWn-25lWhencomparingthethreeoptions,itisbesttousethecombinationplan,whil

20、eshippingentirelybyrailleadstothehighestcosts.Ifcostsofshippingbywaterareexpectedtoriseconsiderablymorethanforshippingbyrail,staywithrailanduseOption1.Ifthereverseistrue,thenuseOption2.Ifthecostcomparisonswillremainroughlythesame,useOption3.Option3isclearlythemostfeasiblebutmaynotbechosenifitistoolo

21、gisticallycumbersome.Moreknowledgeofthesituationisnecessarytodeterminethis.6.2 a)$20millionissavedincomparisonwiththeresultsinFigure6.13byshipping20millionfewerbarrelstoCharlestonand20millionmoretoSt.Louis.b) $40millionissavedincomparisonwiththeresultsinFigure6.17.Thecostofshippingbothcrudeoilandfin

22、ishedproductunderthisplanis$940million+$1,390million=$2,330millionor$2.33billionasavingsof$60millioncomparedtotheoriginalresultsinTable6.20.c) $35millionissavedincomparisonwiththeresultsinpart(b).$75millionissavedincomparisonwiththeresultsinFigure6.17.d) Thissolutioncosts$40millionmorethanthesolutio

23、ninpart(a).Thissolutioncosts$20millionmorethanthesolutionisFigure6.13.Thetotalcostofshippingbothcrudeoilandfinishedproductunderthisplanis$1,355million+$980million=$2,335millionor$2,335billion.Thisis$5millionmorethanthecostofthecombinedtotalobtainedinpart(b),but$55millionlessthanthetotalinTable6.20.e

24、) Thetwotransportationproblems(shippingtorefineriesandshippingtodistributionscenters)arecombinedintoasinglemodel.Theamountshippedtotherefineriesisconstrainedtobenomorethancapacity:TotalReceived(D16:G16)Capacity(D18:G18).Thetotalshippedoutoftherefineriesisconstrainedtoequalthetotalamountshippedin:Shi

25、ppedOut(H31:H34)=Shippedln(J31J34).Thegoalistominimizethetotalcombinedcost(inJ45)whichisthesumofthetwointermediatecosts(inJ20andJ39).Thetotalcombinedcostis$2,320millionor$2.32billion,whichis$10millionlessthaninpart(b),$15millionlessthaninpart(d),and$70millionlessthaninTable6.20.f) IftheLosAngelesref

26、ineryischoseninstead,thenthecombinedshippingcostis$2,450million.IftheGalvestonrefineryischoseninstead,thenthecombinedshippingcostis$2,470million.SiteTotalCostofShippingCrudeOilTotalCostofShippingFinishedProductOperatingCostforNewRefineryTotalVariableCostLosAngeles$880million$1.57billion$620million$3

27、.07billionGalveston870million1.60billion570million3.12billionSt.Louis950million1.37billion530million2.92billiong) Answerswillvary.6.3a)Assignonescientisttoeachofthefiveprojectstomaximizethetotalnumberofbidpoints.TomaximizethescientistspreferencesyouwanttoassignDr.TsaitoleadprojectUp,Dr.Kvaaltoleadpr

28、ojectStable,Dr.ZunertoleadprojectChoice,Dr.MickeytoleadprojectHope,andDr.RollinstoleadprojectRelease.b) Dr.Rollinsisnotavailable,sohis“Supply“incell114isreducedtozero.Sincenowmustallowaprojecttonotbedone,theconstraintsinrows15to17becomeTotalAssigned(B15:F15)Demand(B17:F17)ratherthan=.ProjectUpwouldn

29、otbedone.c) SinceDr.ZoonerorDr.Mickeycanleadtwoprojects,their“Supply“incolumnIischangedto2andthecorrespondingconstraintchangedto(inordertoallowthemtodoeitheroneortwoprojects).Dr.KvaalleadsprojectStable,Dr.ZunerleadsprojectChoice,Dr.TsaileadsprojectRelease,andDr.MickeyleadstheprojectsHopeandUp.d) Und

30、erthenewbidsofDr.Zunertheassignmentdoesnotchange:e) CertainlyDr.ZunercouldbedisappointedthatsheisnotassignedtoprojectStable,especiallywhensheexpressedahigherpreferenceforthatprojectthanthescientistassigned.Theoptimalsolutionmaximizesthepreferencesoverall,butindividualscientistsmaybedisappointed.Wesh

31、ouldthereforemakesuretocommunicatethereasoningbehindtheassignmentstothescientists.f) Wheneverascientistcannotleadaparticularprojectweconstrainthecorrespondingchangingcell(E10,F10,C13,E13,andB14)toequal0.Dr.KvaalleadsprojectStable,Dr.ZunerleadsprojectChoice,Dr.TsaileadsprojectRelease,Dr.Mickeyleadspr

32、ojectUp,andDr.RollinsleadsprojectHope.g) Whenwewanttoassigntwoassigneestothesametaskweneedtoduplicatethattask.ProjectUpisledbyDr.Mickey,StablebyDr.Kvaal,ChoicebyDr.Zuner,HopebyDr.ArriagaandDr.Santos,andReleasebyDr.TsaiandDr.Rollins.h) No.Maximizingoverallpreferencesdoesnotmaximizeindividualpreferenc

33、es.Scientistswhodonotgettheirfirstchoicemaybecomeresentfulandthereforelackthemotivationtoleadtheirassignedproject.Forexample,intheoptimalsolutionofpart(g),Dr.SantosclearlyelectedprojectReleaseashisfirstchoice,buthewasassignedtoleadprojectHope.Inaddition,maximizingpreferencesignoresotherconsiderationsthatshouldbefactoredintotheassignmentdecision.Forexample,thescientistwiththehighestpreferenceforaprojectmaynotbethescientistmostqualifiedtoleadtheproject.