Computing Optimal (s, S) Inventory Policies
A complete computational approach for finding optimal (s, S) inventory policies is developed. The method is an efficient and unified approach for all values of the model parameters, including a non-negative set-up cost, a discount factor 0 \leqq \alpha \leqq 1, and a lead time. The method is derived from renewal theory and stationary analysis, generalized to permit the unit interval range of values for \alpha . Careful attention is given to the problem associated with specifying a starting condition (when \alpha
Volume (Year): 11 (1965)
Issue (Month): 5 (March)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:11:y:1965:i:5:p:525-552. 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 references are entirely missing, you can add them using this form.