Some New Techniques in the Dynamic-Programming Solution of Variational Problems.
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback21 pages | $15.00 | $12.00 20% Web Discount |
An attempt to overcome some difficulties in solving a large class of variational problems in which the underlying equations and the criterion function are linear, although the restraints on the forcing functions may be nonlinear. It is indicated how the method of successive approximations may be combined with the techniques mentioned to reduce general variational problems, in which the equations and criterion function are nonlinear, to sequences of problems which can be solved numerically by sequences of functions of one variable.
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.