Answers are grounded in this paper and cite their sources.
Scarf [6] has shown that the ( s,S ) policy is optimal for a class of discrete review dynamic nonstationary inventory models. In this paper a new proof of this result is found under new conditions which do not imply and are not implied by Scarf’s hypotheses. We replace Scarf’s hypothesis that the one period expected costs are convex by the weaker assumption that the negatives of these expected costs are unimodal. On the other hand we impose the additional assumption not made by Scarf that the absolute minima of the one, period expected costs are (nearly) rising over time. For the infinite period stationary model, this last hypothesis is automatically satisfied. Thus in this case our hypotheses are weaker than Scarf’s. The bounds on the optimal parameter values given by Veinott and Wagner [12] are established for the present case. The bounds in a period are easily computed, and depend only upon the expected costs for that period. Moreover, simple conditions are given which ensure that the optimal parameter values in a given period equal their lower bounds. When there is no fixed charge for ordering, this reduces to earlier results of Karlin [5] and Veinott [9], [10], [11] for the nonstationary case. The above result is exploited to extend the planning horizon theorem of Veinott [9] to the case where there is a fixed charge for ordering.
No takes yet. Share an insight, caveat, or question.
Arthur F. Veinott (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: