Structural Results for Average‐Cost Inventory Models with Markov‐Modulated Demand and Partial Information

We consider a discrete‐time infinite‐horizon inventory system with non‐stationary demand, full backlogging, and deterministic replenishment lead time. Demand arrives according to a probability distribution conditional on the state of the world that undergoes Markovian transitions over time. But the actual state of the world can only be imperfectly estimated based on past demand data. We model the inventory replenishment problem for this system as a Markov decision process (MDP) with an uncountable state space consisting of both the inventory position and the most recent belief, a conditional probability mass function, about the actual state of the world. Assuming that the state of the world evolves as an ergodic Markov chain, using the vanishing discount method along with a coupling argument, we prove the existence of an optimal average cost that is independent of the initial system state. For our linear cost structure, we also establish the average‐cost optimality of a belief‐dependent base‐stock policy. We then discretize the uncountable belief space into a regular grid and observe that the average cost under our discretization converges to the optimal average cost as the number of grid points grows large. Finally, we conduct numerical experiments to evaluate the use of a myopic belief‐dependent base‐stock policy as a heuristic for our MDP with the uncountable state space. On a test bed of 108 instances, the average cost obtained from the myopic policy deviates by no more than a few percent from the best lower bound on the optimal average cost obtained from our discretization.

• 저널Production and Operations Management · 29(1) · 156–173
• 토픽Supply Chain and Inventory Management · Management Information Systems
• DOI10.1111/poms.13088
• 저자Harun Avcı, Kagan Gokbayrak, Emre Nadar