Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities

Steven T. Hackman and Loren K. Platzman
Additional contact information
Steven T. Hackman: Georgia Institute of Technology, Atlanta, Georgia
Loren K. Platzman: Georgia Institute of Technology, Atlanta, Georgia

Operations Research, 1990, vol. 38, issue 5, 902-910

Abstract: We 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. We 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.

Keywords: programming:; nonlinear; algorithms (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.5.902 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:38:y:1990:i:5:p:902-910

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().