ON THE K-TH BEST POLICIES

Abstract : It is shown how the functional equation technique of dynamic programming can be used to determine the optimal, second best, third best, etc., policies for various deterministic and stochastic multistage decision processes. This is of importance in various problems in combinatorial analysis, network and switching theory, feedback control, and sensitivity analysis. A routing problem is discussed in some detail.