Resource Allocation with Tree Constraints

K. M. Mjelde
Additional contact information
K. M. Mjelde: Det norske Veritas, Høvik, Norway

Operations Research, 1983, vol. 31, issue 5, 881-890

Abstract: We extend Zipkin's variant of the Luss and Gupta algorithm for the allocation of a single resource to activities described by concave return functions, to handle additional constraints imposed upon the total allocations to certain subsets of activities, and to subsets of these subsets, and so on. We determine computational times for certain return functions and extensions to problems with an objective function defined by the difference or the ratio of return and cost, and to problems with several resources.

Keywords: 642 separable programs with nested knapsack constraints; 649 resource allocation problems (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.31.5.881 (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:31:y:1983:i:5:p:881-890

Access Statistics for this article

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