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...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research Vol. 147; no. 1; pp. 255 - 267
Main Authors: Libura, Marek, Nikulin, Yury
Format: Journal Article
Language:English
Published: New York Springer Nature B.V 01.10.2006
Subjects:
Accuracy
Hierarchies
Integer programming
Linear programming
Mathematical programming
Operations research
Optimization
Pareto optimum
Sensitivity analysis
Studies
ISSN:0254-5330, 1572-9338
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-006-0071-2