|
Diskretnyi Analiz i Issledovanie Operatsii, 2009, Volume 16, Issue 2, Pages 74–84
(Mi da569)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
On quasistability of a lexicographic MINSUM arrangement problem
V. A. Emelichev, O. V. Karelkina Belarussian State University, Minsk, Belarus
Abstract:
A multicriteria variant of the well-known combinatorial extremal median arrangement problem with sequential minimization of MINSUM criteria is considered. Necessary and sufficient conditions for quasistability of the problem are obtained, i.e. conditions under which sufficiently small initial data perturbations preserve all lexicographic optima of the original problem and allow occurrence of the new ones. Numerical illustration is given. Bibl. 14.
Keywords:
vector MINSUM arrangement problem, lexicographic set, perturbing matrix, quasistability, binary relations.
Received: 02.12.2008
Citation:
V. A. Emelichev, O. V. Karelkina, “On quasistability of a lexicographic MINSUM arrangement problem”, Diskretn. Anal. Issled. Oper., 16:2 (2009), 74–84
Linking options:
https://www.mathnet.ru/eng/da569 https://www.mathnet.ru/eng/da/v16/i2/p74
|
Statistics & downloads: |
Abstract page: | 503 | Full-text PDF : | 96 | References: | 66 | First page: | 8 |
|