On the Computational Solution of Dynamic-Programming Processes-XIV
Download eBook for Free
|PDF file||1 MB||
Use Adobe Acrobat Reader version 10 or higher for the best experience.
Purchase Print Copy
|Add to Cart||Paperback40 pages||$20.00||$16.00 20% Web Discount|
One of a series of studies that applies dynamic-programming techniques to the computational solution of mathematical problems involving multistage decision processes. This memorandum applies the dynamic-programming technique to problems involving the optimal allocation of attack against a target system and the optimal allocation of defense against this attack. In the case of two types of attackers (either manned aircraft and decoys, or missiles of different capabilities), the Lagrange-multiplier technique is applied to reduce the computational solution to one involving sequences of functions of one variable. Large-scale target allocations are resolved computationally in a reasonable period of time with the use of such computers as the RAND JOHNNIAC or the IBM 704.
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.
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.