Structure of optimal policies to periodic-review inventory models with convex costs and backorders for all values of discount factors
This paper describes the structure of optimal policies for discounted periodic-review single-commodity total-cost inventory control problems with fixed ordering costs for finite and infinite horizons. There are known conditions in the literature for optimality of ( s t , S t ) policies for finite-ho...
Gespeichert in:
Veröffentlicht in: | Annals of operations research 2022-10, Vol.317 (1), p.29-45 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper describes the structure of optimal policies for discounted periodic-review single-commodity total-cost inventory control problems with fixed ordering costs for finite and infinite horizons. There are known conditions in the literature for optimality of
(
s
t
,
S
t
)
policies for finite-horizon problems and the optimality of (
s
,
S
) policies for infinite-horizon problems. The results of this paper cover the situation, when such assumption may not hold. This paper describes a parameter, which, together with the value of the discount factor and the horizon length, defines the structure of an optimal policy. For the infinite horizon, depending on the values of this parameter and the discount factor, an optimal policy either is an (
s
,
S
) policy or never orders inventory. For a finite horizon, depending on the values of this parameter, the discount factor, and the horizon length, there are three possible structures of an optimal policy: (1) it is an
(
s
t
,
S
t
)
policy, (2) it is an
(
s
t
,
S
t
)
policy at earlier stages and then does not order inventory, or (3) it never orders inventory. The paper also establishes continuity of optimal value functions and describes alternative optimal actions at states
s
t
and
s
. |
---|---|
ISSN: | 0254-5330 1572-9338 |
DOI: | 10.1007/s10479-017-2548-6 |