Allocating Weapons to Target Complexes by Means of Nonlinear Programming

Richard H. Day
Additional contact information
Richard H. Day: University of Wisconsin, Madison, Wisconsin

Operations Research, 1966, vol. 14, issue 6, 992-1013

Abstract: The paper presents a three-stage method of assigning weapons to targets and illustrates its application with a small sample problem. The method decomposes the general allocation problem into a set of targeting problems in the small and a targeting problem in the large. The former are solved by a sequential optimizing method that provides information for solving the latter by nonlinear programming. The discussion is not advanced and illustrates a basic feature of applied operations research: the combination of existing operational methods to achieve approximative solutions to complicated problems. The study may have some added interest because of its relation to problems of decentralized planning.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.6.992 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:14:y:1966:i:6:p:992-1013

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().