A scenario-based approach for robust linear optimization

Authors:
Marc Goerigk;Anita Schöbel
Affiliations:
Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen, Germany;Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen, Germany
Venue:
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Year:
2011

Citing 8
Cited 0

Robust Solutions to Least-Squares Problems with Uncertain Data

SIAM Journal on Matrix Analysis and Applications
Robust Convex Optimization

Mathematics of Operations Research
The Price of Robustness

Operations Research
Adjustable robust solutions of uncertain linear programs

Mathematical Programming: Series A and B
Robust Optimization for Empty Repositioning Problems

Operations Research
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications

Robust and Online Large-Scale Optimization
Recoverable Robustness in Shunting and Timetabling

Robust and Online Large-Scale Optimization
Light Robustness

Robust and Online Large-Scale Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding robust solutions of an optimization problem is an important issue in practice. The established concept of Ben-Tal et al. [2] requires that a robust solution is feasible for all possible scenarios. However, this concept is very conservative and hence may lead to solutions with a bad objective value and is in many cases hard to solve. Thus it is not suitable for most practical applications. In this paper we suggest an algorithm for calculating robust solutions that is easy to implement and not as conservative as the strict robustness approach. We show some theoretical properties of our approach and evaluate it using linear programming problems from NetLib.