Dynamic Programming and the Calculus of Variations
ResearchPublished 1965
ResearchPublished 1965
A demonstration of the relationships between the calculus of variations, a mathematical discipline concerning certain problems of optimization theory, and dynamic programming, a newer mathematical approach applicable to optimization problems. In addition to explaining and contrasting the two approaches, the Report shows that many results of the calculus of variations become simple and intuitively apparent when examined from the dynamic programming viewpoint. In emphasizing the geometrical and physical insight afforded by this approach, the study shows how these techniques can be applied, for instance to stochastic and adaptive variational problems. It can be used in the study of dynamic programming and other new mathematical formalisms; in optimal control problems, such as the determination of rocket trajectories, the correction of launch errors and inflight disturbances of spacecraft; and in the problems of optimal control found in economics, biology, and the social sciences.
This publication is part of the RAND report series. The report series, a product of RAND from 1948 to 1993, represented the principal publication documenting and transmitting RAND's major research findings and final research.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.