Calculation of Stability Radii for Combinatorial Optimization Problems

Nilotpal Chakravarti and Albert P.M. Wagelmans ()
Additional contact information
Nilotpal Chakravarti: Indian Institute of Management
Albert P.M. Wagelmans: Erasmus University Rotterdam

No 97-106/4, Tinbergen Institute Discussion Papers from Tinbergen Institute

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 (search for similar items in EconPapers)
Date: 1997-10-09
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://papers.tinbergen.nl/97106.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tin:wpaper:19970106

Access Statistics for this paper

More papers in Tinbergen Institute Discussion Papers from Tinbergen Institute Contact information at EDIRC.
Bibliographic data for series maintained by Tinbergen Office +31 (0)10-4088900 ().