Loading…
A graphical method to solve a family of allocation problems
This paper discusses the classical resource allocation problem. By very elementary arguments on Lagrangian duality it is shown that this problem can be reduced to a single one-dimensional maximization of a differentiable concave function. Moreover, a simple graphical method is developed and applied...
Saved in:
Published in: | European journal of operational research 1984-01, Vol.17 (1), p.31-34 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper discusses the classical resource allocation problem. By very elementary arguments on Lagrangian duality it is shown that this problem can be reduced to a single one-dimensional maximization of a differentiable concave function. Moreover, a simple graphical method is developed and applied to a family of well-known problems from the literature. |
---|---|
ISSN: | 0377-2217 1872-6860 |
DOI: | 10.1016/0377-2217(84)90005-5 |