最小費(fèi)用流問(wèn)題及其擴(kuò)展.pdf

1、青島大學(xué)碩士學(xué)位論文最小費(fèi)用流問(wèn)題及其擴(kuò)展姓名：王勤波申請(qǐng)學(xué)位級(jí)別：碩士專業(yè)：應(yīng)用數(shù)學(xué)指導(dǎo)教師：許成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