Computing Robust Basestock
Levels
Daniel Bienstock and Nuri Sercan Ozbay
We
consider how to optimally set the basestock level for
a single inventory buffer when the demand is uncertain, in a robust optimization
framework. We present a family of algorithms based on decomposition that scale
well to problems with hundreds of time periods, and theoretical results on more
general models.