Article ID: | iaor19911765 |
Country: | United States |
Volume: | 38 |
Issue: | 5 |
Start Page Number: | 902 |
End Page Number: | 910 |
Publication Date: | Sep 1990 |
Journal: | Operations Research |
Authors: | Platzman Loren K., Hackman Steven T. |
The authors consider problems of allocating resources to activities where the allocation to each activity is restricted to a general set of admissible values, the objective function is additively-separable but not necessarily concave nor differentiable, and each activity uses at most one resource. They develop a simple algorithm, based on a nonsmooth convex relaxation, that generates a near-optimal solution whenever each allocation is a small fraction of resource capacity.