Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1141852 | Discrete Optimization | 2008 | 26 Pages |
Abstract
This paper considers how to optimally set the basestock level for a single buffer when demand is uncertain, in a robust 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Daniel Bienstock, Nuri Ă–zbay,