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