Polynomial approximation: a new computational technique in dynamic programming-I: allocation processes.

by Richard Ernest Bellman, Robert E. Kalaba, Bella Kotkin


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback32 pages $15.00 $12.00 20% Web Discount

The application of the computational technique of polynomial approximation to problems in dynamic programming. The theoretical applicability of orthogonal polynomials is first discussed and then applied to one- and two-dimensional allocation problems. Numerical results obtained from FORTRAN programs involving Legendre polynomials are presented. 32 pp.

This report is part of the RAND Corporation Research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

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.