Template-Type: ReDIF-Paper 1.0
Series: Tinbergen Institute Discussion Papers
Creation-Date: 1997-10-09
Number: 97-106/4
Author-Name: Nilotpal Chakravarti
Author-Workplace-Name: Indian Institute of Management
Author-Name: Albert P.M. Wagelmans
Author-Email: wagelmans@few.eur.nl
Author-Workplace-Name: Erasmus University Rotterdam
Title: 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 tothe tolerance approach to sensitivity analysis.
Keywords: stability radius; sensitivity analysis; postoptimal analysis; tolerance approach; binary programming; computational complexity
File-Url: https://papers.tinbergen.nl/97106.pdf
File-Format: application/pdf
File-Size: 191845 bytes
Handle: RePEc:tin:wpaper:19970106