Name
Abstract | ||
|---|---|---|
Robustness is about reducing the feasible set of a given nominal optimization problem by cutting “risky” solutions away. To this end, the most popular approach in the literature is to extend the nominal model with a polynomial number of additional variables and constraints, so as to obtain its robust counterpart. Robustness can also be enforced by adding a possibly exponential family of cutting planes, which typically leads to an exponential formulation where cuts have to be generated at run time. Both approaches have pros and cons, and it is not clear which is the best one when approaching a specific problem. In this paper we computationally compare the two options on some prototype problems with different characteristics. We first address robust optimization à la Bertsimas and Sim for linear programs, and show through computational experiments that a considerable speedup (up to 2 orders of magnitude) can be achieved by exploiting a dynamic cut generation scheme. For integer linear problems, instead, the compact formulation exhibits a typically better performance. We then move to a probabilistic setting and introduce the uncertain set covering problem where each column has a certain probability of disappearing, and each row has to be covered with high probability. A related uncertain graph connectivity problem is also investigated, where edges have a certain probability of failure. For both problems, compact ILP models and cutting plane solution schemes are presented and compared through extensive computational tests. The outcome is that a compact ILP formulation (if available) can be preferable because it allows for a better use of the rich arsenal of preprocessing/cut generation tools available in modern ILP solvers. For the cases where such a compact ILP formulation is not available, as in the uncertain connectivity problem, we propose a restart solution strategy and computationally show its practical effectiveness. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s12532-012-0039-y | Math. Program. Comput. |
Keywords | Field | DocType |
Optimization under uncertainty,Cutting planes,Uncertain set covering,Uncertain connectivity problems,90C5 linear programming,90C10 integer programming,90C15 stochastic programming | Set cover problem,Discrete mathematics,Cutting-plane method,Mathematical optimization,Robust optimization,Robustness (computer science),Feasible region,Probabilistic logic,Optimization problem,Mathematics,Speedup | Journal |
Volume | Issue | ISSN |
4 | 3 | 1867-2949 |
Citations | PageRank | References |
25 | 0.99 | 23 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matteo Fischetti | 1 | 2505 | 260.53 |
| Michele Monaci | 2 | 1049 | 60.78 |