Startseite On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

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

  • E. E. Gurevskii und V. A. Emelichev
Veröffentlicht/Copyright: 19. Oktober 2009
Veröffentlichen auch Sie bei De Gruyter Brill
Discrete Mathematics and Applications
Aus der Zeitschrift Band 19 Heft 4

Abstract

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.

Received: 2008-08-28
Published Online: 2009-10-19
Published in Print: 2009-October

© de Gruyter 2009

Heruntergeladen am 30.11.2025 von https://www.degruyterbrill.com/document/doi/10.1515/DMA.2009.022/pdf?lang=de
Button zum nach oben scrollen