Calculation of stability radii for combinatorial optimization problems

Nilotpal Chakravarti; Albert P. M. Wagelmans

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 tothe tolerance approach to sensitivity analysis.

MoreLess

Year of publication:	1997
Authors:	Chakravarti, Nilotpal ; Wagelmans, Albert P. M.
Publisher:	Rotterdam [u.a.] : Tinbergen Inst.
Subject:	Stability radius \| Sensitivity analysis \| Postoptimal analysis \| Tolerance approach \| Binary programming \| Computational complexity \| Mathematische Optimierung \| Mathematical programming \| Theorie \| Theory \| Sensitivitätsanalyse