Operations research : decision making = 运筹学 : 决策方法 / 3rd ed.

1 network models

1.1 basic definitions

1.2 shortest path problems

1.3 maximum flow problems

1.4 cpm and pert

1.5 minimum cost network flow problems

1.6 minimum spanning tree problems

1.7 the network simplex method


2 decision making under uncertainty

2.1 decision criteria

2.2 utility theory

2.3 decision trees

2.4 bayes' rule and decision trees

2.5 decision making with the normal distribution


3 decision making with multiple objectives

3.1 multiattribute decision making in the absence of uncertainty: goal programming

3.2 multiattribute utility functions

3.3 the analytic hierarchy process

.3.4 pareto optimality and tradeoff curves


4 game theory

4.1 two-person zero-sum and constant-sum games: saddle points

4.2 two-person zero-sum games: randomized strategies, domination, and graphical solution

4.3 linear programming and zero-sum games

4.4 two-person non-constant-sum games

4.5 introduction to n-person game theory

4.6 the core of an n-person game

4.7 the shapley value


5 probabilistic dynamic programming

5.1 when current stage costs are uncertain, but the next period's state is certain

5.2 a probabilistic inventory model

5.3 how to maximize the probability of a favorable event occurring

5.4 further examples of probabilistic dynamic programming formulations

5.5 markov decision processes