Technical Note—Extension of the Luss-Gupta Resource Allocation Algorithm by Means of First Order Approximation Techniques

John M. Einbu
Additional contact information
John M. Einbu: SHAPE Technical Centre, The Hague, Netherlands

Operations Research, 1981, vol. 29, issue 3, 621-626

Abstract: A resource allocation algorithm proposed by Luss and Gupta is extended by the introduction of a numerical method for the optimal distribution of a continous resource among preselected activities as an option to the analytical method applied in the original algorithm. The numerical method allows return functions which cannot be dealt with by the analytical method. An integral part of the numerical method is a composite recurrence relation obtained from the Kuhn-Tucker conditions of the problem with linear functions substituted for the derivatives of the return functions. The convergency of the recurrence process is proven for a class of return functions.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.3.621 (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:29:y:1981:i:3:p:621-626

Access Statistics for this article

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