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

DOI10.1007/BF02678665zbMath1033.90117MaRDI QIDQ1592092

Vladimir A. Emelichev, O. A. Yanushkevich

Publication date: 18 February 2004

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

zbMATH Keywords

stability; regularization; lexicographic vector problem; quadratic discrete programming

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C31: Sensitivity, stability, parametric optimization

90C27: Combinatorial optimization

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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