Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions

From MaRDI portal
Revision as of 02:56, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2508796

DOI10.1007/s10559-005-0090-zzbMath1098.90066OpenAlexW2081374742MaRDI QIDQ2508796

Tatyana I. Sergienko, N. V. Semenova, T. T. Lebedeva

Publication date: 20 October 2006

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-005-0090-z




Related Items (28)

On one type of stability for multiobjective integer linear programming problem with parameterized optimalityStability radius of an efficient solution of a vector problem of integer linear programming in the Hölder metricStability of a vector integer quadratic programming problem with respect to vector criterion and constraintsStability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteriaOn the quasistability radius for a multicriteria integer linear programming problem of finding extremum solutionsOn five types of stability of the lexicographic variant of the combinatorial bottleneck problemRegularization of the vector problem with quadratic criteria of Pareto optimizationMulticriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case studyMulti-criteria optimization problems with vector heterogeneous convolutions of criteriaStability radius of a vector integer linear programming problem: Case of a regular norm in the space of criteriaMulti-objective optimization problem: stability against perturbations of input data in vector-valued criterionPostoptimal analysis of a vector minimax combinatorial problemStability radius of a vector investment problem with Savage's minimax risk criteriaUncertainty measure for the Bellman-Johnson problem with interval processing timesMulticriteria combinatorial optimization problems on a set of polypermutationsStability criteria in vector combinatorial bottleneck problems in terms of binary relationsDifferent types of stability of vector integer optimization problem: General approachAn approach to solving discrete vector optimization problems over a combinatorial set of permutationsStability of vector optimization problems with fuzzy weights in the objective functions and fuzzy matrix parameters in the constraintsStability criterion for a lexicographic Boolean optimization problemBoolean problem of sequential minimization of moduli of linear functions and stability theoremsQualitative characteristics of the stability vector discrete optimization problems with different optimality principlesStability kernel of a multicriteria optimization problem under perturbations of input data of the vector criterionAttainability of optimal solutions to a linear problem of multicriterion optimization with respect to the weighed sum of variously important and transitively subordinated criteriaOn the regularization of vector integer quadratic programming problemsA polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangementsInvestment Boolean problem with savage risk criteria under uncertaintyStability and regularization of vector optimization problems under possible criteria disturbances



Cites Work


This page was built for publication: Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions