Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria
In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient 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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2009-06-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v17-n1/v17-n1-(pp-48-57).pdf |
| id |
doaj-2b3c4e33b6ad4ef594688c89967979b0 |
|---|---|
| record_format |
Article |
| spelling |
doaj-2b3c4e33b6ad4ef594688c89967979b02020-11-25T00:27:58ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40422009-06-01171(49)4857Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteriaVladimir A. Emelichev0Olga V. Karelkina1Belarussian State University, ave. Independence, 4, Minsk, 220030, BelarusBelarussian State University, ave. Independence, 4, Minsk, 220030, BelarusIn this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient 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 http://www.math.md/files/csjm/v17-n1/v17-n1-(pp-48-57).pdfmulticriteria combinatorial problemlexicographic setquasi-stabilitybinary relationsperturbing matrix |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Vladimir A. Emelichev Olga V. Karelkina |
| spellingShingle |
Vladimir A. Emelichev Olga V. Karelkina Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria Computer Science Journal of Moldova multicriteria combinatorial problem lexicographic set quasi-stability binary relations perturbing matrix |
| author_facet |
Vladimir A. Emelichev Olga V. Karelkina |
| author_sort |
Vladimir A. Emelichev |
| title |
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria |
| title_short |
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria |
| title_full |
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria |
| title_fullStr |
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria |
| title_full_unstemmed |
Postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria |
| title_sort |
postoptimal analysis of one lexicographic combinatorial problem with non-linear criteria |
| publisher |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova |
| series |
Computer Science Journal of Moldova |
| issn |
1561-4042 |
| publishDate |
2009-06-01 |
| description |
In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and sufficient 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
|
| topic |
multicriteria combinatorial problem lexicographic set quasi-stability binary relations perturbing matrix |
| url |
http://www.math.md/files/csjm/v17-n1/v17-n1-(pp-48-57).pdf |
| work_keys_str_mv |
AT vladimiraemelichev postoptimalanalysisofonelexicographiccombinatorialproblemwithnonlinearcriteria AT olgavkarelkina postoptimalanalysisofonelexicographiccombinatorialproblemwithnonlinearcriteria |
| _version_ |
1725337502067195904 |