Robust recoverable 0-1 optimization problems under polyhedral uncertainty

This paper deals with a robust recoverable approach to 0-1 programming problems. It is assumed that a solution constructed in the first stage can be modified to some extent in the second stage. This modification consists in choosing a solution in some prescribed neighborhood of the current solution. The second stage solution cost can be uncertain and a polyhedral structure of uncertainty is used. The resulting robust recoverable problem is a min-max-min problem, which can be hard to solve when the number of variables is large. In this paper we provide a framework for solving robust recoverable 0-1 programming problems with a specified polyhedral uncertainty and propose several lower bounds and approximate solutions, which can be used for a wide class of 0-1 optimization problems. The results of computational tests for two problems, namely the assignment and the knapsack ones, are also presented.

[1]  Marc Goerigk,et al.  On the recoverable robust traveling salesman problem , 2016, Optim. Lett..

[2]  Samir Khuller,et al.  The complexity of finding most vital arcs and nodes , 1995 .

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

[4]  Maw-Sheng Chern,et al.  The Most Vital Edges in the Minimum Spanning Tree Problem , 1993, Inf. Process. Lett..

[5]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

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

[7]  Adam Kasperski,et al.  Recoverable robust spanning tree problem under interval uncertainty representations , 2017, J. Comb. Optim..

[8]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

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

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

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

[12]  Adam Kasperski,et al.  The recoverable robust spanning tree problem with interval costs is polynomially solvable , 2017, Optim. Lett..

[13]  Rolf H. Möhring,et al.  The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications , 2009, Robust and Online Large-Scale Optimization.

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

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

[16]  Onur Seref,et al.  Incremental Network Optimization: Theory and Algorithms , 2009, Oper. Res..

[17]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

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

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