Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/85514
Authors: 
Chakravarti, Nilotpal
Wagelmans, Albert P.M.
Year of Publication: 
1997
Series/Report no.: 
Tinbergen Institute Discussion Paper 97-106/4
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.
Subjects: 
stability radius
sensitivity analysis
postoptimal analysis
tolerance approach
binary programming
computational complexity
Document Type: 
Working Paper

Files in This Item:
File
Size
187.35 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.