On the complexity of determining tolerances for $\varepsilon $-optimal solutions to min-max combinatorial optimization problems
Volume 30 / 2003
Abstract
This paper studies the complexity of sensitivity analysis for optimal and $\varepsilon $-optimal solutions to general 0-1 combinatorial optimization problems with min-max objectives. Van Hoesel and Wagelmans [9] have studied the complexity of sensitivity analysis of optimal and $\varepsilon $-optimal solutions to min-sum problems, and Ramaswamy et al. [17] the complexity of sensitivity analysis of optimal solutions to min-max problems. We show that under some mild assumptions the sensitivity analysis of $\varepsilon $-optimal solutions to min-max problems is easy if and only if the original problem is easy. This result is interesting since it immediately applies to a large number of problems, and also because the technique used to prove it is different from the ones used in the related papers (for example, in [17] and [9]).
