| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 766 2 |
| Ultima descărcare din IBN: 2017-04-29 15:03 |
| Căutarea după subiecte similare conform CZU |
| 519.6+519.71+517.97 (1) |
| Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
| Cibernetică matematică (94) |
| Ecuații diferențiale. Ecuații integrale. Alte ecuații funcționale. Diferențe finite. Calculul variațional. Analiză funcțională (243) |
 SM ISO690:2012BUKHTOYAROV, Sergei, EMELICHEV, Vladimir. On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles. In: Computer Science Journal of Moldova, 2005, nr. 1(37), pp. 47-58. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Computer Science Journal of Moldova | ||||||
| Numărul 1(37) / 2005 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.6+519.71+517.97 | ||||||
| Pag. 47-58 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference
relation groups within each group and the lexicographic preference relation between them. Quasistability of the problem is
investigated. This type of stability is a discrete analog of Hausdorff lower semi-continuity of the multiple-valued mapping that
defines the choice function. A formula of quasistability radius is
derived for the case of the metric l1: Some known results are
stated as corollaries.
Mathematics Subject Classification 2000: 90C05, 90C10,
90C29, 90C31. |
||||||
| Cuvinte-cheie vector trajectorial problem, set of lexicographically optimal trajectories, quasista- bility, quasistability radius., Pareto set |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Bukhtoyarov, S.E.</dc:creator> <dc:creator>Emelichev, V.A.</dc:creator> <dc:date>2005-06-03</dc:date> <dc:description xml:lang='en'>A multicriterion linear combinatorial problem with a parametric principle of optimality is considered. This principle is defined by a partitioning of partial criteria onto Pareto preference relation groups within each group and the lexicographic preference relation between them. Quasistability of the problem is investigated. This type of stability is a discrete analog of Hausdorff lower semi-continuity of the multiple-valued mapping that defines the choice function. A formula of quasistability radius is derived for the case of the metric l1: Some known results are stated as corollaries. Mathematics Subject Classification 2000: 90C05, 90C10, 90C29, 90C31.</dc:description> <dc:source>Computer Science Journal of Moldova 37 (1) 47-58</dc:source> <dc:subject>vector trajectorial problem</dc:subject> <dc:subject>Pareto set</dc:subject> <dc:subject>set of lexicographically optimal trajectories</dc:subject> <dc:subject>quasista- bility</dc:subject> <dc:subject>quasistability radius.</dc:subject> <dc:title>On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
