A Simple Method to Solve Some Simple Allocation Problems
- 1 June 1987
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 19 (2) , 234-237
- https://doi.org/10.1080/07408178708975391
Abstract
The paper discusses a classical resource allocation problem. Using 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.Keywords
This publication has 4 references indexed in Scilit:
- Technical Note—Allocation of Effort Resources among Competing ActivitiesOperations Research, 1975
- On an Allocation Problem with Multistage ConstraintsOperations Research, 1971
- A Problem in Optimum AllocationOperations Research, 1963
- Some production planning problemsNaval Research Logistics Quarterly, 1957