Abstract
This paper considers the periodic review inventory problem for which one or more parameters of the demand distribution are unknown with a known prior distribution chosen from the natural conjugate family. The Bayesian formulation of this problem results in a dynamic program with a multi-dimensional state space. Two models are analysed: the depletive inventory model of consumable items and the nondepletive model of reparable items. For both models and for some specific demand distributions, it is shown that the solution of the Bayesian model can be reduced to that of solving another dynamic program with a one-dimensional state space. Moreover, an explicit form for the optimal Bayesian ordering policy is given in each case.inventory control, unknown demand, dynamic programming

This publication has 0 references indexed in Scilit: