RUS  ENG
Full version
JOURNALS // Diskretnyi Analiz i Issledovanie Operatsii // Archive

Diskretn. Anal. Issled. Oper., 2009 Volume 16, Issue 2, Pages 74–84 (Mi da569)

This article is cited 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.

UDC: 519.8

Received: 02.12.2008



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025