Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria
Закрыть
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
988 2
Ultima descărcare din IBN:
2017-04-28 17:34
Căutarea după subiecte
similare conform CZU
004:[519.613+519.853] (1)
Информационные технологии. Вычислительная техника. Обработка данных (4156)
Вычислительная математика. Численный анализ (123)
Исследование операций (168)
SM ISO690:2012
EMELICHEV, Vladimir, KARELKINA, Olga. Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria. In: Computer Science Journal of Moldova, 2009, nr. 1(49), pp. 48-57. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 1(49) / 2009 / ISSN 1561-4042 /ISSNe 2587-4330

Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria
CZU: 004:[519.613+519.853]

Pag. 48-57

Emelichev Vladimir, Karelkina Olga
 
Belarusian State University
 
 
Disponibil în IBN: 4 decembrie 2013


Rezumat

In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and su±cient conditions of that type of stability to the initial data perturbations for which all lexicographic optima of the original problem are preserved and occurrence of the new ones is allowed. Mathematics subject classification: 90C27, 90C29, 90C31

Cuvinte-cheie
multicriteria combinatorial problem, lexicographic set, quasi-stability, binary relations, perturbing matrix