Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 1, 1968 | public
Journal Article

Discrete Dynamic Programming Algorithms


Systems engineering problems which can be cast in the shortest-route format and a class of discrete optimal control problems are considered to provide better understanding of the elements of the optimal control problem by comparison to the shortest-route problem from operations research and to redefine the optimal problem for further application of available computational algorithms in systems engineering.

Additional Information

© 1968 American Chemical Society. A portion of this work was supported under National Science Foundation Grant NSF-GK-460.

Additional details

August 21, 2023
October 18, 2023