On an Allocation Problem with Multistage Constraints

Lalitha Sanathanan
Additional contact information
Lalitha Sanathanan: University of Illinois at Chicago Circle, Chicago, Illinois

Operations Research, 1971, vol. 19, issue 7, 1647-1663

Abstract: This paper gives a simple algorithm for finding optimal allocations subject to a hierarchy of limits when the loss function is separable strictly convex and the resources function is linear. Its applications to capital budgeting and multistage sampling are pointed out. The allocation problem considered by Srikantan [ Opns. Res. 11, 265–273 (1963)] is a special case of the problem considered in this paper.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.7.1647 (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:19:y:1971:i:7:p:1647-1663

Access Statistics for this article

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