What is dynamic programming?.
Purchase Print Copy
|Add to Cart||Paperback27 pages||$15.00||$12.00 20% Web Discount|
A description of the theory of dynamic programming as the study of multistage decision processes. An attempt is made to explain a multistage process that is a natural extension of semigroups of operations and to illustrate this process by means of the familiar difference and differential equations. To indicate the range and versatility of the functional-equation approach to multistage decision processes, the study considers some maximization problems taken from calculus; some trajectory problems of the type that occur in the study of rockets, satellites, and space travel; a typical feedback control problem of the type current in modern electronic engineering; and an interesting class of multistage games, "games of survival."
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
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.
The RAND Corporation 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.