Volume 16, No 2, 2009, P. 74-84

UDC 519.8
V. A. Emelichev, O. V. Karelkina
On quasistability of a lexicographic MINSUM arrangement problem

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 100 matrix, quasistability, binary relations.

Emelichev Vladimir Alekseevich 1
Karelkina Olga Vladimirovna 1

1. Belarusian State University,
4 Nezavisimosti Ave., 220030 Minsk, Belarus
e-mail: emelichev@bsu.by, olga.karelkina@gmail.com

 © Sobolev Institute of Mathematics, 2015