Calculation of Stability Radii for Combinatorial Optimization Problems

Abstract

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results to the tolerance approach to sensitivity analysis.sensitivity analysis;computational complexity;binary programming;postoptimal analysis;stability radius;tolerance approach