最小費用流問題及其擴展.pdf

1、青島大學碩士學位論文最小費用流問題及其擴展姓名：王勤波申請學位級別：碩士專業(yè)：應用數(shù)學指導教師：許成20090605Abstract，nlispaperisdividedintotwoparts，thefirstpartisthesensitivityanalysisofminimumcostflOWthesecondpanestablishedthedynamicminimumcostflowmodelandgivenamethodt

2、osolveitInChapterl，wemakeabriefintroductiontothebasicconceptsandnecessaryknowledgeaboutnetworkflowsSOtomakethenecessarypreparationsforthenextchaptersInChapter2，firstweintroducedtheCurrentresearchesathomeandabroadThenweco

3、nsiderwhetheritcanmaintaintheoriginalplanwhenthecostofonesideisadjustedthatiSdiscussingthesensitivityoftheminimumcostflowMinimumcostflowproblemisalinearprogrammingproblem；itcanbedirectlydiscussedwiththelinearprogramminga

4、lgorithmSoitssensitivityanalysiscanalsoUSethetraditionalsimplextableautosolveIfwedoesnotconsiderthenetworkcharacteristicsofthisprogrammingproblem，butcallsthesimplextableauofthegenerallinearprogrammingalgorithm，theefficie

5、ncyisverypOOLAccordingtothenetworkcharacteristiesoftheminimumcostflowproblem，wedesignadifferentalgorithmfromthetraditionalone，experimentalresultsshowthatthisalgorithmefficiencygreatlyChapter3establishedthedynamicminimumc

6、ostflowmodelandgivenamethodtosolveitConsideringofthetimeeffectoneachparameterintheminimumcostflowproblem，firstwegivethedefinitionsofeachparametertoproposethemodelofthedynamicminimumcostflowproblemOnsuchdirectednetworkthe

7、flowcanwaitatanymedialpointsforaperiodoftime；necapacityofarCSandmedialpointsaretimevaryingthecostoftheflowtransmittingthrowanarcaretimevaryingtooThenweintroducetheconceptofdynamicminimumcostaugmentedchains，andprovesomere