Published July 1, 1968 | Version public
Journal Article

Discrete Dynamic Programming Algorithms

Abstract

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

Identifiers

Eprint ID
120804
Resolver ID
CaltechAUTHORS:20230413-744269000.3

Funding

NSF
GK-460

Dates

Created
2023-04-17
Created from EPrint's datestamp field
Updated
2023-04-17
Created from EPrint's last_modified field