Cover: Some Linear Programming Applications to Stockage Problems

Some Linear Programming Applications to Stockage Problems

Published 1967

by Robin B. S. Brooks

Download

Download eBook for Free

FormatFile SizeNotes
PDF file 0.9 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.

Purchase

Purchase Print Copy

 Format Price
Add to Cart Paperback51 pages $23.00

The use of linear programming algorithms for solving Air Force stockage problems such as the following: design of a mobility kit of reparables; single multi-weapon base stockage of reparables, recoverables and war reserve supplements, and EOQ items; and multi-echelon multi-base stockage of recoverable items with and without additional procurement. The decision variables in the last-named case are depot stock levels for each item, base stock levels for each item for each base, and procurement for each item; the policy characteristics are total additional procurement cost, amount of support given the bases, and, for each item, the amount by which procurement plus assets falls short of the sum of base and depot levels. Instead of attempting exact solutions to the problems considered in the study, a procedure is suggested that will provide approximate solutions. It is "fail safe" in the sense that if the policies computed are good approximations to one another, then any of them provides a good approximation to the solution. Since the number of decision variables is large compared with the number of policy characteristics, the standard simplex method is impractical because of the large number of vectors to be enumerated. It is more feasible to solve by the simplex method using multipliers.

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

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.