Recent advances in linear programming applied to global defense

The robustness of simple distributed but computationally intensive procedures for global defense asset allocation has been calculated. The author emulated the weapon allocation function of a battle management processor by limiting knowledge of future outcomes to planning factors for probability of identification and kill. Using planning factors, he forecast the consequences of sequentially assigning a required number of intercepts of each platform per time bin. At the end of one such planning cycle, the numbers of intercepts by each platform against each ballistic threat corridor were coarsely scheduled for the observed raid. As sets of object or event observations updated the raid parameters, the planning cycle was repeated. Overall, the calculations tended to confirm the feasibility of making global allocations in real time