Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 261, Issue 3, Pages 880-892Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2017.02.027
Keywords
Inventory; Periodic-review (s,S) policy; Robust optimization; Demand distribution uncertainty; Dynamic programing
Funding
- National Natural Science Foundation of China [71372186]
- Fundamental Research Funds for the Central Universities [N150604005]
Ask authors/readers for more resources
This study considers a finite-horizon single-product periodic-review inventory management problem with demand distribution uncertainty. The problem is formulated as a dynamic program and the existence of an optimal (s, S) policy is proved. The corresponding dynamic robust counterpart models are then developed for the box and the ellipsoid uncertainty sets. These counterpart models are transformed into tractable linear and second-order cone programs, respectively. The effectiveness and practicality of the proposed robust optimization approaches are validated through a numerical study. (C) 2017 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available