Calculation of Stability Radii for Combinatorial Optimization Problems
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.
|Keywords||binary programming, computational complexity, postoptimal analysis, sensitivity analysis, stability radius, tolerance approach|
Chakravarti, N., & Wagelmans, A.P.M.. (1997). Calculation of Stability Radii for Combinatorial Optimization Problems (No. EI 9740/A). Retrieved from http://hdl.handle.net/1765/1403