Cover: Computational Problems in the Theory of Dynamic Programming.

Computational Problems in the Theory of Dynamic Programming.

Published 1953

by Richard Ernest Bellman

Purchase Print Copy

 Format Price
Add to Cart Paperback21 pages $15.00

A formulation in terms of the dynamic programming approach, of a simple problem involving a sequence of decisions. The resultant functional equation is used to illustrate a number of approximation techniques, employing the particularly important concept of approximation in strategy space.

This report is part of the RAND paper series. The paper was a product of RAND 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.

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.