Robust solutions of linear programming problems contaminated with uncertain data (Q1587934): Difference between revisions

The paper deals with the following problem: How much the optimal solution to the nominal problem can violate the constraints of the perturbed problem. The authors describe a methodology for quantifying the level to which data perturbations may affect the quality of a feasible solution to a LP program and present the associated results for the NETLIB problems. Also, they explain how the Robust Optimization methodology can be used to immune solutions against data perturbations and discuss the results of this immunization for the NETLIB problems.