A perfect information lower bound for robust lot-sizing problems

Marcio Costa Santos (), Michael Poss () and Dritan Nace ()
Additional contact information
Marcio Costa Santos: Université Libre de Bruxelles
Michael Poss: Université de Montpellier
Dritan Nace: Sorbonne universités

Annals of Operations Research, 2018, vol. 271, issue 2, No 24, 887-913

Abstract: Abstract 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).

Keywords: Multi-stage robust optimization; Perfect information; Lot-sizing problem; Complexity (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-018-2908-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:271:y:2018:i:2:d:10.1007_s10479-018-2908-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-018-2908-x

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().