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

上传人:b****5 文档编号:2779287 上传时间:2022-11-15 格式:DOCX 页数:27 大小:1.51MB
下载 相关 举报
数据模型与决策运筹学课后习题和案例答案007.docx_第1页
第1页 / 共27页
数据模型与决策运筹学课后习题和案例答案007.docx_第2页
第2页 / 共27页
数据模型与决策运筹学课后习题和案例答案007.docx_第3页
第3页 / 共27页
数据模型与决策运筹学课后习题和案例答案007.docx_第4页
第4页 / 共27页
数据模型与决策运筹学课后习题和案例答案007.docx_第5页
第5页 / 共27页
点击查看更多>>
下载资源
资源描述

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

《数据模型与决策运筹学课后习题和案例答案007.docx》由会员分享,可在线阅读,更多相关《数据模型与决策运筹学课后习题和案例答案007.docx(27页珍藏版)》请在冰豆网上搜索。

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

数据模型与决策运筹学课后习题和案例答案007

Chapter7

NetworkOptimizationProblems

ReviewQuestions

7.1-1Asupplynodeisanodewherethenetamountofflowgeneratedisafixedpositivenumber.Ademandnodeisanodewherethenetamountofflowgeneratedisafixednegativenumber.Atransshipmentnodeisanodewherethenetamountofflowgeneratedisfixedatzero.

7.1-2Themaximumamountofflowallowedthroughanarcisreferredtoasthecapacityofthatarc.

7.1-3Theobjectiveistominimizethetotalcostofsendingtheavailablesupplythroughthenetworktosatisfythegivendemand.

7.1-4Thefeasiblesolutionspropertyisnecessary.Itstatesthataminimumcostflowproblemwillhaveafeasiblesolutionifandonlyifthesumofthesuppliesfromitssupplynodesequalsthesumofthedemandsatitsdemandnodes.

7.1-5Aslongasallitssuppliesanddemandshaveintegervalues,anyminimumcostflowproblemwithfeasiblesolutionsisguaranteedtohaveanoptimalsolutionwithintegervaluesforallitsflowquantities.

7.1-6Networksimplexmethod.

7.1-7Applicationsofminimumcostflowproblemsincludeoperationofadistributionnetwork,solidwastemanagement,operationofasupplynetwork,coordinatingproductmixesatplants,andcashflowmanagement.

7.1-8Transportationproblems,assignmentproblems,transshipmentproblems,maximumflowproblems,andshortestpathproblemsarespecialtypesofminimumcostflowproblems.

7.2-1Oneofthecompany’smostimportantdistributioncenters(LosAngeles)urgentlyneedsanincreasedflowofshipmentsfromthecompany.

7.2-2Autoreplacementpartsareflowingthroughthenetworkfromthecompany’smainfactoryinEuropetoitsdistributioncenterinLA.

7.2-3TheobjectiveistomaximizetheflowofreplacementpartsfromthefactorytotheLAdistributioncenter.

7.3-1Ratherthanminimizingthecostoftheflow,theobjectiveistofindaflowplanthatmaximizestheamountflowingthroughthenetworkfromthesourcetothesink.

7.3-2Thesourceisthenodeatwhichallflowthroughthenetworkoriginates.Thesinkisthenodeatwhichallflowthroughthenetworkterminates.Atthesource,allarcspointawayfromthenode.Atthesink,allarcspointintothenode.

7.3-3Theamountismeasuredbyeithertheamountleavingthesourceortheamountenteringthesink.

7.3-41.Whereassupplynodeshavefixedsuppliesanddemandnodeshavefixeddemands,thesourceandsinkdonot.

2.Whereasthenumberofsupplynodesandthenumberofdemandnodesinaminimumcostflowproblemmaybemorethanone,therecanbeonlyonesourceandonlyonesinkinastandardmaximumflowproblem.

7.3-5Applicationsofmaximumflowproblemsincludemaximizingtheflowthroughadistributionnetwork,maximizingtheflowthroughasupplynetwork,maximizingtheflowofoilthroughasystemofpipelines,maximizingtheflowofwaterthroughasystemofaqueducts,andmaximizingtheflowofvehiclesthroughatransportationnetwork.

7.4-1Theoriginisthefirestationandthedestinationisthefarmcommunity.

7.4-2Flowcangoineitherdirectionbetweenthenodesconnectedbylinksasopposedtoonlyonedirectionwithanarc.

7.4-3Theoriginnowistheonesupplynode,withasupplyofone.Thedestinationnowistheonedemandnode,withademandofone.

7.4-4Thelengthofalinkcanmeasuredistance,cost,ortime.

7.4-5Sarahwantstominimizehertotalcostofpurchasing,operating,andmaintainingthecarsoverherfouryearsofcollege.

7.4-6When“realtravel”throughanetworkcanendatmorethatonenode,adummydestinationneedstobeaddedsothatthenetworkwillhavejustasingledestination.

7.4-7Quick’smanagementmustconsidertrade-offsbetweentimeandcostinmakingitsfinaldecision.

7.5-1Thenodesaregiven,butthelinksneedtobedesigned.

7.5-2Astate-of-the-artfiber-opticnetworkisbeingdesigned.

7.5-3Atreeisanetworkthatdoesnothaveanypathsthatbeginandendatthesamenodewithoutbacktracking.Aspanningtreeisatreethatprovidesapathbetweeneverypairofnodes.Aminimumspanningtreeisthespanningtreethatminimizestotalcost.

7.5-4Thenumberoflinksinaspanningtreealwaysisonelessthanthenumberofnodes.Furthermore,eachnodeisdirectlyconnectedbyasinglelinktoatleastoneothernode.

7.5-5Todesignanetworksothatthereisapathbetweeneverypairofnodesattheminimumpossiblecost.

7.5-6No,itisnotaspecialtypeofaminimumcostflowproblem.

7.5-7Agreedyalgorithmwillsolveaminimumspanningtreeproblem.

7.5-8Applicationsofminimumspanningtreeproblemsincludedesignoftelecommunicationnetworks,designofalightlyusedtransportationnetwork,designofanetworkofhigh-voltagepowerlines,designofanetworkofwiringonelectricalequipment,anddesignofanetworkofpipelines.

Problems

7.1a)

b)

c)

7.2a)

展开阅读全文
相关资源
猜你喜欢
相关搜索

当前位置:首页 > 工程科技 > 能源化工

copyright@ 2008-2022 冰豆网网站版权所有

经营许可证编号:鄂ICP备2022015515号-1