On the Optimal Allocation of Limited Resources

A concave programming problem is presented, which is a model for an operations-research problem arising in both military and commercial applications. It is amenable to linear programming methods and can be solved by a sequence of applications of the simplex algorithm.