On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria
We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the Pareto choice function. A vector problem on a syst...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2004-06-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v12-n1/v12-n1-(pp3-24).pdf |
_version_ | 1817992411270348800 |
---|---|
author | Vladimir A. Emelichev Kirill G. Kuzmin Andrey M. Leonovich |
author_facet | Vladimir A. Emelichev Kirill G. Kuzmin Andrey M. Leonovich |
author_sort | Vladimir A. Emelichev |
collection | DOAJ |
description | We consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the Pareto choice function. A vector problem on a system of subsets of a finite set (trajectorial problem) with non-linear partial criteria is in focus. Two necessary and sufficient conditions for stability of this problem are proved.
Mathematics Subject Classification: 2000, 90C10, 90C05, 90C29, 90C31 |
first_indexed | 2024-04-14T01:25:56Z |
format | Article |
id | doaj.art-0a4e28b68c6444ac9ec28729f05e9af4 |
institution | Directory Open Access Journal |
issn | 1561-4042 |
language | English |
last_indexed | 2024-04-14T01:25:56Z |
publishDate | 2004-06-01 |
publisher | Vladimir Andrunachievici Institute of Mathematics and Computer Science |
record_format | Article |
series | Computer Science Journal of Moldova |
spelling | doaj.art-0a4e28b68c6444ac9ec28729f05e9af42022-12-22T02:20:25ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422004-06-01121(34)324On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteriaVladimir A. Emelichev0Kirill G. Kuzmin1Andrey M. Leonovich2Belorussian State University, Mechanics-Mathematics Department, ave. Fr. Skoriny, 4, Minsk, 220050, BelarusBelorussian State University, Mechanics-Mathematics Department, ave. Fr. Skoriny, 4, Minsk, 220050, BelarusBelorussian State University, Mechanics-Mathematics Department, ave. Fr. Skoriny, 4, Minsk, 220050, BelarusWe consider one type of stability (quasistability) of a vector combinatorial problem of finding the Pareto set. Under quasistability we understand a discrete analogue of lower semicontinuity by Hausdorff of the many-valued mapping, which defines the Pareto choice function. A vector problem on a system of subsets of a finite set (trajectorial problem) with non-linear partial criteria is in focus. Two necessary and sufficient conditions for stability of this problem are proved. Mathematics Subject Classification: 2000, 90C10, 90C05, 90C29, 90C31http://www.math.md/files/csjm/v12-n1/v12-n1-(pp3-24).pdfVector trajectorial problemthe Pareto setquasi-stability |
spellingShingle | Vladimir A. Emelichev Kirill G. Kuzmin Andrey M. Leonovich On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria Computer Science Journal of Moldova Vector trajectorial problem the Pareto set quasi-stability |
title | On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria |
title_full | On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria |
title_fullStr | On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria |
title_full_unstemmed | On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria |
title_short | On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria |
title_sort | on quasistability of a vector combinatorial problem with sigma minmax and sigma minmin partial criteria |
topic | Vector trajectorial problem the Pareto set quasi-stability |
url | http://www.math.md/files/csjm/v12-n1/v12-n1-(pp3-24).pdf |
work_keys_str_mv | AT vladimiraemelichev onquasistabilityofavectorcombinatorialproblemwithsigmaminmaxandsigmaminminpartialcriteria AT kirillgkuzmin onquasistabilityofavectorcombinatorialproblemwithsigmaminmaxandsigmaminminpartialcriteria AT andreymleonovich onquasistabilityofavectorcombinatorialproblemwithsigmaminmaxandsigmaminminpartialcriteria |