Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty

In this paper a class of robust two-stage combinatorial optimization problems is discussed. It is assumed that the uncertain second-stage costs are specified in the form of a convex uncertainty set, in particular polyhedral or ellipsoidal ones. It is shown that the robust two-stage versions of basic network optimization and selection problems are NP-hard, even in a very restrictive cases. Some exact and approximation algorithms for the general problem are constructed. Polynomial and approximation algorithms for the robust two-stage versions of basic problems, such as the selection and shortest path problems, are also provided.

[1]  Michael Poss,et al.  Robust combinatorial optimization with knapsack uncertainty , 2017, Discret. Optim..

[2]  Michael Poss,et al.  Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty , 2021, Oper. Res..

[3]  Alan M. Frieze,et al.  On the random 2-stage minimum spanning tree , 2005, SODA '05.

[4]  Daniel Kuhn,et al.  K-Adaptability in Two-Stage Robust Binary Programming , 2015, Oper. Res..

[5]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[6]  Adam Kasperski,et al.  Two-stage Combinatorial Optimization Problems under Risk , 2018, Theor. Comput. Sci..

[7]  Chaitanya Swamy,et al.  An approximation scheme for stochastic linear programming and its application to stochastic integer programs , 2006, JACM.

[8]  Adam Kasperski,et al.  On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty , 2018, Eur. J. Oper. Res..

[9]  Igor Averbakh,et al.  On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..

[10]  Adam Kasperski,et al.  Robust recoverable and two-stage selection problems , 2015, Discret. Appl. Math..

[11]  Paweł Zieliński,et al.  Robust Discrete Optimization Under Discrete and Interval Uncertainty: A Survey , 2016 .

[12]  Mohit Singh,et al.  On Two-Stage Stochastic Minimum Spanning Trees , 2005, IPCO.

[13]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[14]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .

[15]  Adam Kasperski,et al.  On the approximability of robust spanning tree problems , 2010, Theor. Comput. Sci..

[16]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[17]  Christoph Buchheim,et al.  Min–max–min robust combinatorial optimization , 2016, Mathematical Programming.

[18]  Gerhard J. Woeginger,et al.  Complexity and in-approximability of a selection problem in robust optimization , 2013, 4OR.

[19]  Marc Goerigk,et al.  Robust Combinatorial Optimization with Locally Budgeted Uncertainty , 2020 .

[20]  A. Frieze,et al.  On the random 2-stage minimum spanning tree , 2006 .

[21]  Amir Ardestani-Jaafari,et al.  Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems , 2015, Oper. Res..

[22]  Christina Büsing.  Recoverable robust shortest path problems , 2012, Networks.

[23]  Christoph Buchheim,et al.  Robust combinatorial optimization under convex and discrete cost uncertainty , 2018, EURO J. Comput. Optim..

[24]  Eli Upfal,et al.  Commitment under uncertainty: Two-stage stochastic matching problems , 2007, Theor. Comput. Sci..

[25]  Jonathan Cole Smith,et al.  Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems , 2015, J. Sched..

[26]  Dick den Hertog,et al.  A survey of adjustable robust optimization , 2019, Eur. J. Oper. Res..

[27]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[28]  Eduardo Conde,et al.  An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion , 2004, Math. Program..

[29]  Ebrahim Nasrabadi,et al.  Robust optimization with incremental recourse , 2013, ArXiv.

[30]  A. Ben-Tal,et al.  Adjustable robust solutions of uncertain linear programs , 2004, Math. Program..

[31]  Adam Kasperski,et al.  On the approximability of minmax (regret) network optimization problems , 2008, Inf. Process. Lett..

[32]  Alexandre Dolgui,et al.  Min–max and min–max (relative) regret approaches to representatives selection problem , 2012, 4OR.

[33]  Long Zhao,et al.  Solving two-stage robust optimization problems using a column-and-constraint generation method , 2013, Oper. Res. Lett..

[34]  Laurent El Ghaoui,et al.  Robust Optimization , 2021, ICORES.

[35]  Adam Kurpisz,et al.  Approximability of the robust representatives selection problem , 2014, Oper. Res. Lett..

[36]  Daniel Vanderpooten,et al.  Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..

[37]  Anita Schöbel,et al.  Algorithm Engineering in Robust Optimization , 2016, Algorithm Engineering.

[38]  Kyungsik Lee,et al.  Robust optimization approach for a chance-constrained binary knapsack problem , 2016, Math. Program..

[39]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[40]  Arkadi Nemirovski,et al.  Robust solutions of uncertain linear programs , 1999, Oper. Res. Lett..