On stability kernel of a multicriteria combinatorial minimax problem

A multicriteria variant of the combinatorial extremal bottleneck problem with four well-known types of optimality principles (Pareto, Smale, Slater, and lexicographic) is considered. The structure of the set of solutions which preserve respective optimality for any changes of parameters of minimax criteria within “small” neighborhood is investigated. Such set is called a stability kernel. Bibl. 16.