Research Article Open Access

Tolerances Applied in Combinatorial Optimization

Boris Goldengorin, Gerold Jäger and Paul Molitor

Abstract

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.

Journal of Computer Science
Volume 2 No. 9, 2006, 716-734

DOI: https://doi.org/10.3844/jcssp.2006.716.734

Submitted On: 6 February 2006 Published On: 30 September 2006

How to Cite: Goldengorin, B., Jäger, G. & Molitor, P. (2006). Tolerances Applied in Combinatorial Optimization. Journal of Computer Science, 2(9), 716-734. https://doi.org/10.3844/jcssp.2006.716.734

  • 14,301 Views
  • 2,267 Downloads
  • 29 Citations

Download

Keywords

  • Sensitivity analysis
  • upper tolerance
  • lower tolerance