Stability and accuracy functions in multicriteria linear combinatorial optimization problems

We consider a vector linear combinatorial optimization problem in which initial coefficients of objective functions are subject to perturbations. For Pareto and lexicographic principles of efficiency we introduce appropriate measures of the quality of a given feasible solution. These measures corres...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Annals of operations research Ročník 147; číslo 1; s. 255 - 267
Hlavní autoři: Libura, Marek, Nikulin, Yury
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.10.2006
Témata:
Accuracy
Hierarchies
Integer programming
Linear programming
Mathematical programming
Operations research
Optimization
Pareto optimum
Sensitivity analysis
Studies
ISSN:0254-5330, 1572-9338
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider a vector linear combinatorial optimization problem in which initial coefficients of objective functions are subject to perturbations. For Pareto and lexicographic principles of efficiency we introduce appropriate measures of the quality of a given feasible solution. These measures correspond to so-called stability and accuracy functions defined earlier for scalar optimization problems. Then we study properties of such functions and calculate the maximum norms of perturbations for which an efficient solution preserves the efficiency. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-006-0071-2