| Article ID: | iaor20011521 |
| Country: | Netherlands |
| Volume: | 23 |
| Issue: | 1/2 |
| Start Page Number: | 1 |
| End Page Number: | 7 |
| Publication Date: | Aug 1998 |
| Journal: | Operations Research Letters |
| Authors: | Wagelmans A.P.M., Chakravarti N. |
| Keywords: | combinatorial analysis, computational analysis |
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.