Bayes Solution to Dynamic Inventory Models Under Unknown Demand Distribution
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.
Volume (Year): 31 (1985)
Issue (Month): 9 (September)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/Email:
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:31:y:1985:i:9:p:1150-1160. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.