Tolerances Applied in Combinatorial Optimization
Boris Goldengorin, Gerold Jäger and Paul Molitor
DOI : 10.3844/jcssp.2006.716.734
Journal of Computer Science
Volume 2, Issue 9
In this paper we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (∑, ∏, MAX) we give some basic properties on upper and lower tolerances. We show that the upper tolerance of an element is well defined, how to compute the upper tolerance of an element and give equivalent formulations when the upper tolerance is +∞ or > 0. Analogous results are given for the lower tolerance and some results on the relationship between lower and upper tolerances are given.
© 2006 Boris Goldengorin, Gerold Jäger and Paul Molitor. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.