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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
