Computation of Approximate Optimal Policies in a Partially Observed Inventory Model With Rain Checks

Abstract

This paper proposes a new methodology to solve partially observed inventory problems. Generally, these problems have infinitedimensional states that are conditional distribution of the inventory level. Our methodology involves linearizing the state transitions via unnormalized probabilities. It then uses an appropriate functional basis to represent the state. Considering the speed and stability of computations, we choose truncated Chebyshev polynomials as the basis. We use Fast Fourier Transforms along with an appropriate discretization of inventory levels to speed up the computations. These main ideas are to obtain an iterative algorithm to solve a partially observed inventory model with rain checks. In this model, the inventory manager (IM) does not know the inventory level when it is positive. Otherwise, the IM fully observes it. This model provides a context to illustrate our methodology, which applies to other such models. Although this model has been studied mathematically in the literature, the use of our algorithm provides a numerical approximation of the optimal order quantities.These are compared to the orders released under a base mean-stock policy, where the IM replaces the unobserved inventory level with its mean and applies the well-known base stock policy. We show numerically that the optimal order quantity is very close to the base mean-stock order quantity, when the variance of the inventory distribution is small. When the mean of the inventory distribution is large, the optimal order quantity is more than the base mean-stock quantity, and it is the other way around when the mean is small or negative. These insights are explained via uncertainty and information effects and their interplay. We expect this interplay to show up in other partially observed inventory models.