K-Adaptability in Two-Stage Distributionally Robust Binary Programming

We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate second-stage policies here-and-now and implement the best of these policies once the uncertain parameters have been observed. We analyze the approximation quality and the computational complexity of the K-adaptability problem, and we derive explicit mixed-integer linear programming reformulations. We also provide efficient procedures for bounding the probabilities with which each of the K second-stage policies is selected.


Published in:
Operations Research Letters, 44, 1, 6-11
Year:
2016
Publisher:
Amsterdam, Elsevier Science Bv
ISSN:
0167-6377
Keywords:
Note:
Available from Optimization Online
Laboratories:




 Record created 2015-04-24, last modified 2018-03-17

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)