Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem
From MaRDI portal
Publication:557470
DOI10.1023/B:CASA.0000028099.91014.d8zbMath1066.90118MaRDI QIDQ557470
T. T. Lebedeva, Tatyana I. Sergienko
Publication date: 30 June 2005
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
integer variables; multicriteriality; stability with respect to constraints; vector discrete optimization
90C29: Multi-objective and goal programming
90C31: Sensitivity, stability, parametric optimization
90C27: Combinatorial optimization
Related Items
Unnamed Item, Postoptimal analysis of a vector minimax combinatorial problem, Stability criteria in vector combinatorial bottleneck problems in terms of binary relations, Different types of stability of vector integer optimization problem: General approach, On the regularization of vector integer quadratic programming problems, Stability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteria, Qualitative characteristics of the stability vector discrete optimization problems with different optimality principles, A priori determination of bounds for the optimal value of variables in integer linear programming problems, Stability radius of an efficient solution of a vector problem of integer linear programming in the Hölder metric, Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints, Stability criterion for a lexicographic Boolean optimization problem, Boolean problem of sequential minimization of moduli of linear functions and stability theorems, Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions, On five types of stability of the lexicographic variant of the combinatorial bottleneck problem, Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
