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

Computational Issues in an Infinite-Horizon, Multiechelon Inventory Model

Author

Listed:
  • Awi Federgruen

    (Columbia University, New York, New York)

  • Paul Zipkin

    (Columbia University, New York, New York)

Abstract

Clark and Scarf (Clark, A., H. Scarf. 1960. Optimal policies for a multi-echelon inventory problem. Mgmt. Sci. 6 475–490.) characterize optimal policies in a two-echelon, two-location inventory model. We extend their result to the infinite-horizon case (for both discounted and average costs). The computations required are far easier than for the finite horizon problem. Further simplification is achieved for normal demands. We also consider the more interesting case of multiple locations at the lower echelon. We show that, under certain conditions, this problem can be closely approximated by a model with one such location. A rather simple computation thus yields both a near-optimal policy and a good approximation of the cost of the system.

Suggested Citation

  • Awi Federgruen & Paul Zipkin, 1984. "Computational Issues in an Infinite-Horizon, Multiechelon Inventory Model," Operations Research, INFORMS, vol. 32(4), pages 818-836, August.
    • Handle: RePEc:inm:oropre:v:32:y:1984:i:4:p:818-836
    DOI: 10.1287/opre.32.4.818
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.32.4.818
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.32.4.818?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
    ---><---

    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:32:y:1984:i:4:p:818-836. 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.