Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
This paper deals with a general combinatorial optimization problem in which closed intervals and fuzzy intervals model uncertain element weights. The notion of a deviation interval is introduced, which allows us to characterize the optimality and the robustness of solutions and elements. The problem of computing deviation intervals is addressed and some new complexity results in this field are provided. Possibility theory is then applied to generalize a deviation interval and a solution concept to fuzzy ones.
Year of publication: |
2010
|
---|---|
Authors: | Kasperski, Adam ; Zielinski, Pawel |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 200.2010, 3, p. 680-687
|
Publisher: |
Elsevier |
Keywords: | Minmax regret Interval Possibility theory Combinatorial optimization |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
On combinatorial optimization problems on matroids with uncertain weights
Kasperski, Adam, (2007)
-
On the equivalence of two optimization methods for fuzzy linear programming problems
Chanas, Stefan, (2000)
-
The computational complexity of the relative robust shortest path problem with interval data
Zielinski, Pawel, (2004)
- More ...