Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback15 pages $20.00 $16.00 20% Web Discount

A presentation of a wide variety of complicated multidimensional computational problems that can be treated by dynamic programming theory. Part I considers a logistics problem which involves the purchasing and servicing of numerous items. Part II shows how target-selection problems arising in the attack on a target complex by weapons of several different types or by successive waves of weapons of the same type may be treated. Part III discusses the solution of the optimal-inventory problem with delivery lags of arbitrary length. 17 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.