# zbMATH — the first resource for mathematics

Average cost optimality in inventory models with Markovian demands. (English) Zbl 0873.90021
Summary: This paper is concerned with long-run average cost minimization of a stochastic inventory problem with Markovian demand, fixed ordering cost, and convex surplus cost. The states of the Markov chain represent different possible states of the environment. Using a vanishing discount approach, a dynamic programming equation and the corresponding verification theorem are established. Finally, the existence of an optimal state-dependent $$(s,S)$$ policy is proved.

##### MSC:
 90B05 Inventory, storage, reservoirs 90C39 Dynamic programming
Full Text:
##### References:
 [1] KARLIN, S., and FABENS, A., The (s, S) Inventory Model under Markovian Demand Process, Mathematical Methods in the Social Sciences, Edited by K. Arrow, S. Karlin, and P. Suppes, Stanford University Press, Stanford, California, pp. 159–175, 1960. [2] SONG, J. S., and ZIPKIN, P., Inventory Control in a Fluctuating Demand Environment, Operations Research, Vol. 41, pp. 351–370, 1993. · Zbl 0798.90035 [3] SETHI, S., and CHENG, F., Optimality of (s, S) Policies in Inventory Models with Markovian Demand, Operations Research (to appear). · Zbl 0895.90079 [4] OZEKICI, S., and PARLAR, M., Periodic Review Inventory Models in Random Environment, Working Paper, Bogazici University, Istanbul, Turkey, 1995. · Zbl 0970.90005 [5] ARAPOSTATHIS, A., BORKAR, V. S., FERNANDEZ-GAUCHERAND, E., GHOSH, M. K., and MARCUS, S. I., Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey, SIAM Journal on Control and Optimization, Vol. 31, pp. 282–344, 1993. · Zbl 0770.93064 [6] IGLEHART, D., Dynamic Programming and Stationary Analysis of Inventory Problems, Multistage Inventory Models and Techniques, Edited by H. Scarf, D. Gilford, and M. Shelly, Stanford University Press, Stanford, California, pp. 1–31, 1963. · Zbl 0126.16004 [7] VEINOTT, A., and WAGNER, H., Computing Optimal (s, S) Policies, Management Science, Vol. 11, pp. 525–552, 1965. · Zbl 0137.14102 [8] KARLIN, S., Steady-State Solutions, Studies in the Mathematical Theory of Inventory and Production, Edited by K. Arrow, S. Karlin, and H. Scarf, Stanford University Press, Stanford, California, pp. 223–269, 1958. [9] KARLIN, S., The Application of Renewal Theory to the Study of Inventory Policies, Studies in the Mathematical Theory of Inventory and Production, Edited by K. Arrow, S. Karlin, and H. Scarf, Stanford University Press, Stanford, California, pp. 270–297, 1958. [10] VEINOTT, A., On the Optimality of (s, S) Inventory Policies: New Conditions and a New Proof, SIAM Journal on Applied Mathematics, Vol. 14, pp. 1067–1083, 1966. · Zbl 0173.47603 [11] ZHENG, Y. S., A Simple Proof for Optimality of (s, S) Policies in Infinite-Horizon Inventory Systems, Journal of Applied Probability, Vol. 28, pp. 802–810, 1991. · Zbl 0747.90032 [12] STIDHAM, S., JR., Cost Models for Stochastic Clearing Systems, Operations Research, Vol. 25, pp. 100–127, 1977. · Zbl 0371.90069 [13] ZHENG, Y. S., and FEDERGRUEN, A., Finding Optimal (s, S) Policies Is about as Simple as Evaluating a Single Policy, Operations Research, Vol. 39, pp. 654–665, 1991. · Zbl 0749.90024 [14] FEDERGRUEN, A., and ZIPKIN, P., An Efficient Algorithm for Computing Optimal (s, S) Policies, Operations Research, Vol. 32, pp. 1268–1285, 1984. · Zbl 0553.90031 [15] HU, J. Q., NANANUKUL, S., and GONG, W. B., A New Approach to (s, S) Inventory Systems, Journal of Applied Probability, Vol. 30, pp. 898–912, 1993. · Zbl 0820.90036 [16] FU, M., Sample Path Derivatives for (s, S) Inventory Systems, Operations Research, Vol. 42, pp. 351–364, 1994. · Zbl 0805.90038 [17] PORTEUS, E., Numerical Comparison of Inventory Policies for Periodic Review Systems, Operations Research, Vol. 33, pp. 134–152, 1985. · Zbl 0571.90016 [18] SAHIN, I., Regeneration Inventory Systems: Operating Characteristics and Optimization, Bilkent University Lecture Series, Springer Verlag, New York, New York, 1990. [19] BEYER, D., and SETHI, S. P., The Classical Average Cost Inventory Models of Iglehart (1963) and Veinott and Wagner (1965) Revisited, Working Paper, University of Toronto, Toronto, Ontario, Canada, 1996. · Zbl 0943.90003 [20] SETHI, S. P., SUO, W., TAKSAR, M. I., and ZHANG, Q., Optimal Production Planning in a Stochastic Manufacturing System with Long-Run Average Cost, Journal of Optimization Theory and Applications, Vol. 92, pp. 161–168, 1997. · Zbl 0886.90084 [21] SCARF, H., The Optimality of (s, S) Policies in the Dynamic Inventory Problem, Mathematical Methods in the Social Sciences, Edited by K. Arrow, S. Karlin, and P. Suppes, Stanford University Press, Stanford, California, pp. 196–202, 1960. · Zbl 0203.22102 [22] SETHI, S., and CHENG, F., Optimality of (s, S) Policies in Inventory Models with Markovian Demand Processes, C2MIT Working Paper, University of Toronto, Toronto, Ontario, Canada, 1993. · Zbl 0895.90079 [23] FELLER, W., An Introduction to Probability Theory and Its Application, Vol. 2, 2nd Edition, Wiley, New York, New York, 1971. · Zbl 0219.60003 [24] YOSIDA, K., Functional Analysis, 6th Edition, Springer Verlag, New York, New York, 1980. · Zbl 0435.46002 [25] SZNADJER, R., and FILAR, J. A., Some Comments on a Theorem of Hardy and Littlewood, Journal of Optimization Theory and Applications, Vol. 75, pp. 201–208, 1992. · Zbl 0795.90085 [26] GIKHMAN, I., and SKOROKHOD, A., Stochastic Differential Equations, Springer Verlag, Berlin, Germany, 1972. [27] BEYER, D., SETHI, S. P., and TAKSAR, M., Inventory Models with Markovian Demand and Cost Functions of Polynomial Growth, Working Paper, University of Toronto, Toronto, Ontario, Canada, 1996. · Zbl 0908.90108 [28] BEYER, D., SETHI, S. P., and TAKSAR, M., Inventory Models with Average Cost, book, to appear. · Zbl 0908.90108
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.