A perfect information lower bound for robust lot-sizing problems
- 51 Downloads
Robust multi-stage linear optimization is hard computationally and only small problems can be solved exactly. Hence, robust multi-stage linear problems are typically addressed heuristically through decision rules, which provide upper bounds for the optimal solution costs of the problems. We investigate in this paper lower bounds inspired by the perfect information relaxation used in stochastic programming. Specifically, we study the uncapacitated robust lot-sizing problem, showing that different versions of the problem become tractable whenever the non-anticipativity constraints are relaxed. Hence, we can solve the resulting problem efficiently, obtaining a lower bound for the optimal solution cost of the original problem. We compare numerically the solution time and the quality of the new lower bound with the dual affine decision rules that have been proposed by Kuhn et al. (Math Program 130:177–209, 2011).
KeywordsMulti-stage robust optimization Perfect information Lot-sizing problem Complexity
- Baumann, F., Buchheim, C., & Ilyina, A. (2014). Lagrangean decomposition for mean-variance combinatorial optimization. In Combinatorial optimization—third international symposium, ISCO 2014, Lisbon, Portugal, March 5–7, 2014. Revised Selected Papers (pp. 62–74).Google Scholar
- Bougeret, M., Pessoa, A., & Poss, M. (2016). Robust scheduling with budgeted uncertainty. Discrete Applied Mathematics Conditionally. https://hal.archives-ouvertes.fr/hal-01345283/document.
- Garey, M. R., & Johnson, D. S. (2002). Computers and intractability (Vol. 29). New York: W. H. Freeman.Google Scholar
- Kouvelis, P., & Yu, G. (2013). Robust discrete optimization and its applications (Vol. 14). Berlin: Springer.Google Scholar
- Pochet, Y., & Wolsey, L. (2013). Production planning by mixed integer programming. Berlin: Springer.Google Scholar