Solutions to a probabilistic resource allocation problem

The probabilistic problem of allocating defensive resources against a ballistic missile threat is described and modeled. Since this problem is NP-complete, solution algorithms are heuristic. Two heuristic solution approaches are described, one based on a greedy scheme and the other on linear programming. Results of the application of the two techniques to a small problem show that the greedy technique is faster, but the linear programming solution is better