2026-06-01T19:49:33Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/183092026-02-03T11:51:12Zcom_10630_2254col_10630_37959

On computational procedures for Value Iteration in inventory control Kortenhorst, Cleo G.F. Ortega, Gloria L. Hendrix, Eligius María Theodorus Programación dinámica Dynamic programming (DP) is often seen in inventory control to lead to optimal ordering policies. When considering stationary demand, Value Iteration (VI) may be used to derive the best policy. In this paper, our focus is on the computational procedures to implement VI. Practical implementation requires bounding carefully the state space and demand in an adequate way. We illustrate with small cases the challenge of the implementation. We also show that handling service level constraints is not straightforward from a DP point of view. Moreover, when taking the age distribution into account for perishable products, the curse of dimensionality provides an additional challenge. 2019-09-11T10:44:48Z 2019-09-11T10:44:48Z 2019 2019-09-11 conference output https://hdl.handle.net/10630/18309 eng 9th IFAC Conference on Manufacturing Modelling, Management and Control Berlin 28-30 agosto 2019 http://creativecommons.org/licenses/by-nd/4.0/ open access Attribution-NoDerivatives 4.0 Internacional