A new algorithm for the solution of multi-state dynamic programming problems

This paper presents a new algorithm for the solution of multi-state dynamic programming problems, referred to as the Progressive Optimality Algorithm. It is a method of successive approximation using a general two-stage solution. The algorithm is computationally efficient and has minimal storage requirements. A description of the algorithm is given including a proof of convergence. Performance characteristics for a trial problem are summarized.