IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v19y1971i7p1647-1663.html
   My bibliography  Save this article

On an Allocation Problem with Multistage Constraints

Author

Listed:
  • Lalitha Sanathanan

    (University of Illinois at Chicago Circle, Chicago, Illinois)

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.

Suggested Citation

  • Lalitha Sanathanan, 1971. "On an Allocation Problem with Multistage Constraints," Operations Research, INFORMS, vol. 19(7), pages 1647-1663, December.
    • Handle: RePEc:inm:oropre:v:19:y:1971:i:7:p:1647-1663
    DOI: 10.1287/opre.19.7.1647
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.19.7.1647
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.19.7.1647?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    2. Friedrich, Ulf & Münnich, Ralf & de Vries, Sven & Wagner, Matthias, 2015. "Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling," Computational Statistics & Data Analysis, Elsevier, vol. 92(C), pages 1-12.
    3. Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink, 2022. "On a Reduction for a Class of Resource Allocation Problems," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1387-1402, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:19:y:1971:i:7:p:1647-1663. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.