Loading…
The Allocation of Linear Resources to Concave Activities -- A Finite Algorithm with a Polynomial Time Bound
An algorithm is given for the solution of resource allocation problems with linear and continuous resources and strictly increasing, strictly concave and differentiable return functions.
Saved in:
Published in: | The Journal of the Operational Research Society 1982-11, Vol.33 (11), p.1045-1046 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | An algorithm is given for the solution of resource allocation problems with linear and continuous resources and strictly increasing, strictly concave and differentiable return functions. |
---|---|
ISSN: | 0160-5682 1476-9360 |
DOI: | 10.1057/jors.1982.217 |