On five types of stability of the lexicographic variant of the combinatorial bottleneck problem

We consider the combinatorial vector minimax problem with ordered criteria. We formulate necessary and sufficient conditions for the five known types of stability of the problem which describe the behaviour of the lexicographic set with respect to perturbations of the initial data for the vector criterion.