Template-Type: ReDIF-Paper 1.0
Author-Name: Chakravarti, N.
Author-Name-Last: Chakravarti
Author-Name: Wagelmans, A.P.M.
Author-Name-Last: Wagelmans
Author-Name-First: Albert
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 to the tolerance approach to sensitivity analysis.
Creation-Date: 1997-01-01
File-URL: https://repub.eur.nl/pub/1403/eeb19960111120070.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 9740/A
Keywords: binary programming, computational complexity, postoptimal analysis, sensitivity analysis, stability radius, tolerance approach
Handle: RePEc:ems:eureir:1403