Integer Prim-Read Solutions to a Class of Target Defense Problems

We study the choice of a deployment and firing doctrine for defending separated point targets of (potentially) different values against an attack by an unknown number of sequentially arriving missiles. We minimize the total number of defenders, subject to an upper bound on the maximum expected value damage per attacking weapon. We show that the Greedy Algorithm produces an optimal integral solution to this problem.