|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2009, Number 3, Pages 13–29
(Mi basm233)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 21.10.2009
Citation:
Vladimir Emelichev, Eberhard Girlich, Olga Karelkina, “Postoptimal analysis of multicriteria combinatorial center location problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2009, no. 3, 13–29
Linking options:
https://www.mathnet.ru/eng/basm233 https://www.mathnet.ru/eng/basm/y2009/i3/p13
|
Statistics & downloads: |
Abstract page: | 450 | Full-text PDF : | 51 | References: | 48 | First page: | 1 |
|