IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v101y1999i3d10.1023_a1021734003033.html
   My bibliography  Save this article

The Classical Average-Cost Inventory Models of Iglehart and Veinott–Wagner Revisited

Author

Listed:
  • D. Beyer

    (Hewlett-Packard Laboratories)

  • S. P. Sethi

    (University of Texas at Dallas)

Abstract

This paper revisits the classical papers of Iglehart (Ref. 1) and Veinott and Wagner (Ref. 2) devoted to stochastic inventory problems with the criterion of long-run average cost minimization. We indicate some of the assumptions that are used implicitly without verification in their stationary distribution approach to the problems and provide the missing (nontrivial) verification. In addition to completing their analysis, we examine the relationship between the stationary distribution approach and the dynamic programming approach to the average-cost stochastic inventory problems.

Suggested Citation

  • D. Beyer & S. P. Sethi, 1999. "The Classical Average-Cost Inventory Models of Iglehart and Veinott–Wagner Revisited," Journal of Optimization Theory and Applications, Springer, vol. 101(3), pages 523-555, June.
    • Handle: RePEc:spr:joptap:v:101:y:1999:i:3:d:10.1023_a:1021734003033
    DOI: 10.1023/A:1021734003033
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021734003033
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021734003033?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Awi Federgruen & Paul Zipkin, 1984. "An Efficient Algorithm for Computing Optimal ( s , S ) Policies," Operations Research, INFORMS, vol. 32(6), pages 1268-1285, December.
    2. Shaler Stidham, 1977. "Cost Models for Stochastic Clearing Systems," Operations Research, INFORMS, vol. 25(1), pages 100-127, February.
    3. Michael C. Fu, 1994. "Sample Path Derivatives for (s, S) Inventory Systems," Operations Research, INFORMS, vol. 42(2), pages 351-364, April.
    4. Suresh P. Sethi & Feng Cheng, 1997. "Optimality of ( s , S ) Policies in Inventory Models with Markovian Demand," Operations Research, INFORMS, vol. 45(6), pages 931-939, December.
    5. Evan L. Porteus, 1985. "Numerical Comparisons of Inventory Policies for Periodic Review Systems," Operations Research, INFORMS, vol. 33(1), pages 134-152, February.
    6. D. Beyer & S. P. Sethi & M. Taksar, 1998. "Inventory Models with Markovian Demands and Cost Functions of Polynomial Growth," Journal of Optimization Theory and Applications, Springer, vol. 98(2), pages 281-323, August.
    7. D. Beyer & S. P. Sethi, 1997. "Average Cost Optimality in Inventory Models with Markovian Demands," Journal of Optimization Theory and Applications, Springer, vol. 92(3), pages 497-526, March.
    8. Yu-Sheng Zheng & A. Federgruen, 1991. "Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy," Operations Research, INFORMS, vol. 39(4), pages 654-665, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Eugene A. Feinberg & Yan Liang, 2022. "On the optimality equation for average cost Markov decision processes and its validity for inventory control," Annals of Operations Research, Springer, vol. 317(2), pages 569-586, October.
    2. Ketzenberg, Michael E. & Metters, Richard D., 2020. "Adapting operations to new information technology: A failed “internet of things” application," Omega, Elsevier, vol. 92(C).
    3. Eugene A. Feinberg & Mark E. Lewis, 2018. "On the convergence of optimal actions for Markov decision processes and the optimality of (s, S) inventory policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(8), pages 619-637, December.
    4. Van Foreest, Nicky D. & Kilic, Onur A., 2023. "An intuitive approach to inventory control with optimal stopping," European Journal of Operational Research, Elsevier, vol. 311(3), pages 921-924.
    5. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Discrete‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 131-153, January.
    6. Woonghee Tim Huh & Ganesh Janakiraman & Mahesh Nagarajan, 2011. "Average Cost Single-Stage Inventory Models: An Analysis Using a Vanishing Discount Approach," Operations Research, INFORMS, vol. 59(1), pages 143-155, February.
    7. Eugene A. Feinberg & Yan Liang, 2022. "Structure of optimal policies to periodic-review inventory models with convex costs and backorders for all values of discount factors," Annals of Operations Research, Springer, vol. 317(1), pages 29-45, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Discrete‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 131-153, January.
    2. D. Beyer & S. P. Sethi, 1997. "Average Cost Optimality in Inventory Models with Markovian Demands," Journal of Optimization Theory and Applications, Springer, vol. 92(3), pages 497-526, March.
    3. Sandun C. Perera & Suresh P. Sethi, 2023. "A survey of stochastic inventory models with fixed costs: Optimality of (s, S) and (s, S)‐type policies—Continuous‐time case," Production and Operations Management, Production and Operations Management Society, vol. 32(1), pages 154-169, January.
    4. Hao Yuan & Qi Luo & Cong Shi, 2021. "Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs," Management Science, INFORMS, vol. 67(10), pages 6089-6115, October.
    5. Xiang, Mengyuan & Rossi, Roberto & Martin-Barragan, Belen & Tarim, S. Armagan, 2018. "Computing non-stationary (s, S) policies using mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 271(2), pages 490-500.
    6. Xie, Xiaolan, 1998. "Stability analysis and optimization of an inventory system with bounded orders," European Journal of Operational Research, Elsevier, vol. 110(1), pages 126-149, October.
    7. Xiaoming Li, 2013. "Managing Dynamic Inventory Systems with Product Returns: A Markov Decision Process," Journal of Optimization Theory and Applications, Springer, vol. 157(2), pages 577-592, May.
    8. Gah-Yi Ban, 2020. "Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring," Operations Research, INFORMS, vol. 68(2), pages 309-326, March.
    9. Manafzadeh Dizbin, Nima & Tan, Barış, 2020. "Optimal control of production-inventory systems with correlated demand inter-arrival and processing times," International Journal of Production Economics, Elsevier, vol. 228(C).
    10. Feng Cheng & Suresh P. Sethi, 1999. "A Periodic Review Inventory Model with Demand Influenced by Promotion Decisions," Management Science, INFORMS, vol. 45(11), pages 1510-1523, November.
    11. Bijvank, Marco & Vis, Iris F.A., 2011. "Lost-sales inventory theory: A review," European Journal of Operational Research, Elsevier, vol. 215(1), pages 1-13, November.
    12. Xiang, Mengyuan & Rossi, Roberto & Martin-Barragan, Belen & Tarim, S. Armagan, 2023. "A mathematical programming-based solution method for the nonstationary inventory problem under correlated demand," European Journal of Operational Research, Elsevier, vol. 304(2), pages 515-524.
    13. Tunc, Huseyin & Kilic, Onur A. & Tarim, S. Armagan & Eksioglu, Burak, 2011. "The cost of using stationary inventory policies when demand is non-stationary," Omega, Elsevier, vol. 39(4), pages 410-415, August.
    14. Lagodimos, A.G. & Christou, I.T. & Skouri, K., 2012. "Computing globally optimal (s,S,T) inventory policies," Omega, Elsevier, vol. 40(5), pages 660-671.
    15. Jianqiang Hu & Cheng Zhang & Chenbo Zhu, 2016. "( s , S ) Inventory Systems with Correlated Demands," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 603-611, November.
    16. Awi Federgruen & Min Wang, 2015. "Inventory Models with Shelf-Age and Delay-Dependent Inventory Costs," Operations Research, INFORMS, vol. 63(3), pages 701-715, June.
    17. Xiuli Chao & Xiting Gong & Cong Shi & Chaolin Yang & Huanan Zhang & Sean X. Zhou, 2018. "Approximation Algorithms for Capacitated Perishable Inventory Systems with Positive Lead Times," Management Science, INFORMS, vol. 64(11), pages 5038-5061, November.
    18. D. Beyer & S. P. Sethi & M. Taksar, 1998. "Inventory Models with Markovian Demands and Cost Functions of Polynomial Growth," Journal of Optimization Theory and Applications, Springer, vol. 98(2), pages 281-323, August.
    19. Li Chen & Jing-Sheng Song & Yue Zhang, 2017. "Serial Inventory Systems with Markov-Modulated Demand: Derivative Bounds, Asymptotic Analysis, and Insights," Operations Research, INFORMS, vol. 65(5), pages 1231-1249, October.
    20. Yin, Rui & Rajaram, Kumar, 2007. "Joint pricing and inventory control with a Markovian demand model," European Journal of Operational Research, Elsevier, vol. 182(1), pages 113-126, October.

    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:spr:joptap:v:101:y:1999:i:3:d:10.1023_a:1021734003033. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.