The problem considered is that of allocating a given number of missiles against area and point defenses and the cities protected by these defenses so as to maximize the total damage done to the cities. An integer nonlinear programming formulation of the problem is developed and a branch-and-bound algorithm for its solution is offered. Computational considerations are discussed and numerical results are given. (Author)
Optimal Allocation of Missiles Against Area and Point Defenses
1969
23 pages
Report
No indication
English
Operations Research , Nuclear Warfare , Guided missile targets , Nonlinear programming , Kill probabilities , Algorithms , Launching sites , Threat evaluation , Mathematical models , Set theory , Optimization , Urban areas , Damage assessment , Antimissile defense systems , Allocation models , Integer programming , Branch and bound method
Defense - U.S. seeks data on non-airborne defenses against portable missiles
Online Contents | 2006
MISSILES - L'lnde affãute ses nouvelles défenses sol-air.
Online Contents | 1994
Tactics, defenses in Iraq shift to meet advanced missiles
Online Contents | 2004