Stability criterion for a lexicographic Boolean optimization problem

DOI10.1007/s10559-007-0082-2zbMath1144.90450OpenAlexW2023193240MaRDI QIDQ2480504

Yanyan Li

Publication date: 31 March 2008

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

Full work available at URL: https://doi.org/10.1007/s10559-007-0082-2

zbMATH Keywords

stability criterionlexicographic optimumBoolean problemweakly lexicographic optimum

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (1)

Uncertainty measure for the Bellman-Johnson problem with interval processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem
• Stability conditions for the vector path problem in lexicographic discrete optimization
• Regularization of a lexicographic vector problem of integer programming
• Stability and regularization of the lexicographic vector problem of quadratic discrete programming
• Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
• Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
• Stability and Regularization of Vector Problems of Integer Linear Programming

This page was built for publication: Stability criterion for a lexicographic Boolean optimization problem