Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints

Authors:
T. T. Lebedeva;T. I. Sergienko
Affiliations:
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine;V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2006

Citing 0
Cited 6

Stability criterion for a lexicographic Boolean optimization problem

Cybernetics and Systems Analysis
Stability criteria in vector combinatorial bottleneck problems in terms of binary relations

Cybernetics and Systems Analysis
Different types of stability of vector integer optimization problem: General approach

Cybernetics and Systems Analysis
Combinatorial optimization under uncertainty

Cybernetics and Systems Analysis
On the regularization of vector integer quadratic programming problems

Cybernetics and Systems Analysis
Postoptimal analysis of a vector minimax combinatorial problem

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper analyzes five types of stability against perturbations of initial data in criterion functions and constraints of vector integer quadratic optimization problems. Necessary and sufficient conditions are proved for all the types of stability. The relationship among stability with respect to changes of vector criterion coefficients, stability with respect to changes of initial data in constraints, and stability with respect to vector criterion and constraints is established.