Abstract
The purpose of this paper is to provide a survey of the state of the art of dynamic programming. An indication of the problem areas to which dynamic programming has been applied is contained. In addition, a discussion of various theoretical advances in dynamic programming is presented. The paper is divided into four areas, a discussion of continuous parameter dynamic programs is given and applications optimal control problems are discussed. The second section contains a discussion of discrete deterministic dynamic programs and applications to areas such as scheduling. The third section contains a discussion of a solution in stochastic decision problems via dynamic programming. The final section is devoted to the treatment of combinatorial problems and an indication of how they can often be handled via dynamic programming. An extensive bibliography of both theory and applications is appended.