ABSTRACT
The concept of dynamic programming comes from the principle of optimality (Bellman, 1952, 1953) as a solution for sequential optimization problems. That is, an optimal solution has the property that whatever the initial state and the initial decisions are, the remaining decisions must constitute an optimal solution with regard to the state resulting from the first decision. The network problems of multi-stage programming are shown in Figure 6.1.
