Abstract
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.
Original language | English |
---|---|
Journal | European Journal of Operational Research |
Volume | 17 |
Issue number | 1 |
Pages (from-to) | 31-34 |
ISSN | 0377-2217 |
Publication status | Published - 1984 |