On quasistability of a vector combinatorial problem with \Sigma-MINMAX and \Sigma-MINMIN partial criteria

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...

Descripció completa

Dades bibliogràfiques
Autors principals: Vladimir A. Emelichev, Kirill G. Kuzmin, Andrey M. Leonovich
Format: Article
Idioma:English
Publicat: Vladimir Andrunachievici Institute of Mathematics and Computer Science 2004-06-01
Col·lecció:Computer Science Journal of Moldova
Matèries:
Vector trajectorial problem
the Pareto set
quasi-stability
Accés en línia:http://www.math.md/files/csjm/v12-n1/v12-n1-(pp3-24).pdf

Internet

http://www.math.md/files/csjm/v12-n1/v12-n1-(pp3-24).pdf

Ítems similars