RUS  ENG
Full version
JOURNALS // Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica // Archive

Bul. Acad. Ştiinţe Repub. Mold. Mat., 2009 Number 3, Pages 13–29 (Mi basm233)

This article is cited in 1 paper

Research articles

Postoptimal analysis of multicriteria combinatorial center location problem

Vladimir Emelicheva, Eberhard Girlichb, Olga Karelkinaa

a Belarusian State University, Minsk, Belarus
b Otto-von-Guericke-Universitat, Magdeburg, Germany

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.

Keywords and phrases: center location problem, Pareto optimal trajectory, lexicographically optimal trajectory, perturbing matrix, trajectory stability, binary relations, stability criteria.

MSC: 90C27, 90C29, 90C31, 90C47

Received: 21.10.2009

Language: English



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025