For the infinite horizon, single item inventory problem, assume an ordering cost M(i) + K(j) for changing the stock level from i to j (for example, M(i) + K(j) - c \cdot (j - i) + K), a holding plus shortage cost l(j), and a probability \varphi (j, k) of demand j - k when the stock level is j. New conditions for optimality of (s, S) policies are given, and a computational method is given. Both the total discounted cost and the average cost criteria are treated. The method is simplified when the demand distribution is Bernoulli or geometric. When, in addition, the costs K(j) - K, and l(x) is -Lx for x > 0, zero for 0 \leqq x \leqq I, for some I \geqq 0, and H(x - I) for x > I, then conditions are given for an optimal policy (s*, S*) to have s* - -1 or S* - I. Further, for the same assumptions but without the integrality restriction on s and S, specific formulas are given for s* and S* when the criterion is average cost; and equations, which can be solved for s* and S*, are given when the criterion is total discounted cost.
[1]
H. Scarf.
THE OPTIMALITY OF (S,S) POLICIES IN THE DYNAMIC INVENTORY PROBLEM
,
1959
.
[2]
Ronald A. Howard,et al.
Dynamic Programming and Markov Processes
,
1960
.
[3]
D. Blackwell.
Discrete Dynamic Programming
,
1962
.
[4]
C. Derman.
On Sequential Decisions and Markov Chains
,
1962
.
[5]
D. Iglehart.
Optimality of (s, S) Policies in the Infinite Horizon Dynamic Inventory Problem
,
1963
.
[6]
A. F. Veinott,et al.
Computing Optimal (s, S) Inventory Policies
,
1965
.
[7]
Jr. Arthur F. Veinott.
On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof
,
1966
.
[8]
Ellis L. Johnson.
Optimality and Computation of (\sigma, S) Policies in the Multi-Item Infinite Horizon Inventory Problem
,
1967
.
[9]
Ellis L. Johnson.
Computation and Structure of Optimal Reset Policies
,
1967
.