Some basics on tolerances
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (?, ?, MAX) we prove 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 proven for the lower tolerance and some results on the relationship between lower and upper tolerances are given.
Year of publication: |
2005
|
---|---|
Authors: | Molitor, P. ; Jäger, G. ; Goldengorin, B. |
Institutions: | Faculteit Economie en Bedrijfskunde, Rijksuniversiteit Groningen |
Saved in:
freely available
Saved in favorites
Similar items by person
-
How to make a greedy heuristic for the asymmetric traveling salesman problem competitive
Jäger, G., (2005)
-
Pension wealth and household savings in Europe: Evidence from SHARELIFE
Alessie, R.J.M., (2012)
-
Fast heuristics for a dynamic paratransit problem
Cremers, M.L.A.G., (2008)
- More ...