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.

• Type: Journal
• Year: 1998
• Where: ORL
• Authors: Nilotpal Chakravarti, Albert P. M. Wagelmans
• Keywords: Binary Programming Problems, Min Sum, ORL 1998, Stability Radius