Robust solutions of Linear Programming problems contaminated with uncertain data
- 2.9k Downloads
- 642 Citations
Abstract.
Optimal solutions of Linear Programming problems may become severely infeasible if the nominal data is slightly perturbed. We demonstrate this phenomenon by studying 90 LPs from the well-known NETLIB collection. We then apply the Robust Optimization methodology (Ben-Tal and Nemirovski [1–3]; El Ghaoui et al. [5, 6]) to produce “robust” solutions of the above LPs which are in a sense immuned against uncertainty. Surprisingly, for the NETLIB problems these robust solutions nearly lose nothing in optimality.
Keywords
Program Problem Linear Program Problem Robust Optimization Uncertain Data Robust Solution
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer-Verlag Berlin Heidelberg 2000