A survey of dynamic programming computational procedures

Abstract

Although dynamic programming has long provided a powerful approach to optimization problems, its applicability has been somewhat limited because of the large computational requirements of the standard computational algorithm. In recent years a number of new procedures with greatly reduced computational requirements have been developed. The purpose of this paper is to survey a number of the more promising of those techniques. A review of the theory of dynamic programming and the standard computational algorithm is included. Several applications of the new techniques are discussed.