Authors: Vladimir Emelichev, Eberhard Girlich, Olga Karelkina
Abstract
A multicriteria variant of a well known combinatorial MINMAX location problem with Pareto and lexicographic optimality principles is considered. Necessary and sufficient conditions of an optimal solution stability of such problems to the initial data perturbations are formulated in terms of binary relations. Numerical examples are given.
E-mail: , ,
Fulltext

–
0.17 Mb