Stability and regularization of the lexicographic vector problem of quadratic discrete programming

DOI10.1007/BF02678665zbMath1033.90117MaRDI QIDQ1592092

O. A. Yanushkevich, Vladimir A. Emelichev

Publication date: 18 February 2004

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

zbMATH Keywords

stabilityregularizationlexicographic vector problemquadratic discrete programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (3)

Stability criterion for a lexicographic Boolean optimization problem ⋮ Boolean problem of sequential minimization of moduli of linear functions and stability theorems ⋮ On the regularization of vector integer quadratic programming problems

Cites Work

• Stability of linear path problems in lexicographic optimization
• Stability conditions for the vector path problem in lexicographic discrete optimization
• On a quantitative measure of stability for a vector problem in integer programming
• Regularization of a lexicographic vector problem of integer programming
• Some forms of stability of a combinatorial problem of lexicographic optimization
• Regularization of integer vector optimization problems
• Stability in vector optimization path problems
• Problems in sequential programming
• On the radii of steadiness, quasi-steadiness, and stability of a vector trajectory problem on lexicographic optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability and regularization of the lexicographic vector problem of quadratic discrete programming