On the dynamic programming treatment of discrete-time variational problems.
ResearchPublished 1966
ResearchPublished 1966
This study considers a modification of the usual continuous-time optimal control problem, in which a decision, chosen from a continuum of admissible decisions, is rendered at each of a discrete and finite set of points in time. Dynamic programming techniques are used to derive two necessary conditions for relative minimality of a trajectory under the rather strong assumption of sufficient smoothness of the optimal value function. Under certain convexity assumptions, a "maximum principle" of Pontryagin type is also deduced, although, in general, there is no such principle for discrete problems. 31 pp. Ref.
This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.
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.