Calculation of Stability Radii for Combinatorial Optimization Problems
January 1997
Research Paper
This publication is part of collection
| Related Files |
|---|
View PDF Version
(eeb19960111120070.pdf, 0.2MB) |
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.
Keywords
- sensitivity analysis
- computational complexity
- binary programming
- postoptimal analysis
- stability radius
- tolerance approach
Automatically Extracted Terms
- stability radius
- objective
- value
- stability
- radius
- problem
- x 2 x
- solution
- vector
- objective vector c
- objective coe cients
- instance
- function
- problem instance
- objective vector
- tolerance approach
- tolerance
- algorithm
- polynomial
- value function
