A gradient-based method to calculate \((s,S)\) policies
From MaRDI portal
Publication:6047706
DOI10.1016/J.ORL.2023.06.008zbMath1525.90015OpenAlexW4384701727MaRDI QIDQ6047706
Chenbo Zhu, Jianqiang Hu, Weimin Dai
Publication date: 12 September 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2023.06.008
Cites Work
- Unnamed Item
- Unnamed Item
- An Efficient Algorithm for Computing Optimal (s, S) Policies
- Computing optimal (s, S) policies in inventory models with continuous demands
- Numerical Comparisons of Inventory Policies for Periodic Review Systems
- On the Objective Function Behavior in (s, S) Inventory Models
- Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
- Phase-type distributions: open problems and a few properties
- A new approach to (s, S) inventory systems
- Computing Optimal (s, S) Inventory Policies
- On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof
- Optimal Inventory Policy
This page was built for publication: A gradient-based method to calculate \((s,S)\) policies