Postoptimal analysis of a vector minimax combinatorial problem

DOI10.1007/s10559-011-9323-5zbMath1298.90084OpenAlexW2001721227MaRDI QIDQ464908

Vladimir A. Emelichev, Vladimir Korotkov, Kirill G. Kuzmin

Publication date: 30 October 2014

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

Full work available at URL: https://doi.org/10.1007/s10559-011-9323-5

zbMATH Keywords

perturbations of initial datarange criteriastability with respect to vector criterionvector minimax combinatorial problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem
• Stability criteria in vector combinatorial bottleneck problems in terms of binary relations
• Different types of stability of vector integer optimization problem: General approach
• On the quasistability of trajectory problems of vector optimization
• Some concepts of stability analysis in combinatorial optimization
• Stability of discrete optimization problems
• Stability of a vector integer quadratic programming problem with respect to vector criterion and constraints
• Stability of discrete vector problems with the parametric principle of optimality
• 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: Postoptimal analysis of a vector minimax combinatorial problem