Stability radius of an efficient solution of a vector problem of integer linear programming in the Hölder metric

DOI10.1007/s10559-006-0097-0zbMath1119.90029OpenAlexW2038225811MaRDI QIDQ2371728

Kirill G. Kuzmin, Vladimir A. Emelichev

Publication date: 5 July 2007

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

Full work available at URL: https://doi.org/10.1007/s10559-006-0097-0

zbMATH Keywords

vector optimizationstability radiusinteger linear programming

Mathematics Subject Classification ID

Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Related Items (5)

Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric ⋮ On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization ⋮ Different types of stability of vector integer optimization problem: General approach ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem
• Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions
• Stability radius of a lexicographic optimum of a vector problem of Boolean programming
• Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability radius of an efficient solution of a vector problem of integer linear programming in the Hölder metric