The most common measure of effectiveness used in determining the optimal s, S inventory policies is the total cost function per unit time, Es, Δ, Δ = S-s. In stationary analysis, this function is constructed through the limiting distribution of on-hand inventory, and it involves some renewal-theoretic elements. For Δ â¥ 0 given, Es, Δ turns out to be convex in s, so that the corresponding optimal reorder point, s1Δ, can be characterized easily. However, Es1Δ, Δ is not in general unimodal on Δ â¥ 0. This requires the use of complicated search routines in computations, as there is no guarantee that a local minimum is global.
Both for periodic and continuous review systems with constant lead times, full backlogging and linear holding and shortage costs, we prove in this paper that E's1Δ, Δ = 0, Δ â¥ 0, is both necessary and sufficient for a global minimum Es1Δ, Δ is pseudoconvex on Δ â¥ 0 if the underlying renewal function is concave. The optimal stationary policy can then be computed efficiently by a one-dimensional search routine. The renewal function in question is that of the renewal process of periodic demands in the periodic review model and of demand.sizes in the continuous review model.
[1]
Shaler Stidham,et al.
Cost Models for Stochastic Clearing Systems
,
1977,
Oper. Res..
[2]
A. F. Veinott,et al.
Computing Optimal (s, S) Inventory Policies
,
1965
.
[3]
Mark Brown,et al.
BOUNDS, INEQUALITIES, AND MONOTONICITY PROPERTIES FOR SOME SPECIALIZED RENEWAL PROCESSES'
,
1980
.
[4]
E. Silver,et al.
s, S Policies Under Continuous Review and Discrete Compound Poisson Demand
,
1978
.
[5]
Richard E. Barlow,et al.
Statistical Theory of Reliability and Life Testing: Probability Models
,
1976
.
[6]
Izzet Sahin,et al.
On the Stationary Analysis of Continuous Review (s, S) Inventory Systems with Constant Lead Times
,
1979,
Oper. Res..
[7]
Mordecai Avriel,et al.
Nonlinear programming
,
1976
.
[8]
Shaler Stidham,et al.
Stochastic clearing systems
,
1974
.