| 目 录 1NetworkModels 1.1BasicDefinitions 1.2ShortestPathProblems 1.3MaximumFlowProblems 1.4CPMandPERT 1.5MinimumCostNetworkFlowProblems 1.6MinimumSpanningTreeProblems 1.7TheNetworkSimplexMethod 2DecisionMakingUnderUncertainty 2.1DecisionCriteria 2.2UtilityTheory 2.3DecisionTrees 2.4Bayes'RuleandDecisionTrees 2.5DecisionMakingwiththeNormalDistribution 3DecisionMakingwithMultipleObjectives 3.1MultiattributeDecisionMakingintheAbsenceofUncertainty:GoalProgramming 3.2MultiattributeUtilityFunctions 3.3TheAnalyticHierarchyProcess 3.4ParetoOptimalityandTradeoffCurves 4GameTheory 4.1Two-PersonZero-SumandConstant-SumGames:SaddlePoints 4.2Two-PersonZero-SumGames:RandomizedStrategies,Domination,andGraphicalSolution 4.3LinearProgrammingandZero-SumGames 4.4Two-PersonNon-Constant-SumGames 4.5Introductionton-PersonGameTheory 4.6TheCoreofann-PersonGame 4.7TheShapleyValue 5ProbabilisticDynamicProgramming 5.1WhenCurrentStageCostsAreUncertain,buttheNextPeriod'sStateIsCertain 5.2AProbabilisticInventoryModel 5.3HowtoMaximizetheProbabilityofaFavorableEventOccurring 5.4FurtherExamplesofProbabilisticDynamicProgrammingFormulations 5.5MarkovDecisionProcesses |
商品评论(0条)