Postoptimal analysis of multicriteria combinatorial center location problem
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
952 0
SM ISO690:2012
EMELICHEV, Vladimir, GIRLICH, Eberhard, KARELKINA, Olga. Postoptimal analysis of multicriteria combinatorial center location problem. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2009, nr. 3(61), pp. 13-29. ISSN 1024-7696.
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
Numărul 3(61) / 2009 / ISSN 1024-7696 /ISSNe 2587-4322

Postoptimal analysis of multicriteria combinatorial center location problem

Pag. 13-29

Emelichev Vladimir, Girlich Eberhard, Karelkina Olga
 
Institute of Mathematics and Computer Science ASM
 
Disponibil în IBN: 9 decembrie 2013


Rezumat

A multicriteria variant of a well known combinatorial MINMAX location problem with Pareto and lexicographic optimality principles is considered. Necessary and sufficient conditions of an optimal solution stability of such problems to the initial data perturbations are formulated in terms of binary relations. Numerical examples are given.

Cuvinte-cheie
Center location problem, Pareto optimal trajectory, lexi- cographically optimal trajectory, perturbing matrix, trajectory stability

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-8878</cfResPublId>
<cfResPublDate>2009-12-01</cfResPublDate>
<cfVol>61</cfVol>
<cfIssue>3</cfIssue>
<cfStartPage>13</cfStartPage>
<cfISSN>1024-7696</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/8878</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>Postoptimal analysis of multicriteria combinatorial center location problem</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>Center location problem; Pareto optimal trajectory; lexi-
cographically optimal trajectory; perturbing matrix; trajectory stability</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'>A multicriteria variant of a well known combinatorial MINMAX location problem with Pareto and lexicographic optimality principles is considered. Necessary
and sufficient conditions of an optimal solution stability of such problems to the initial data perturbations are formulated in terms of binary relations. Numerical examples are given.</cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009-12-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2009-12-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-29436</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009-12-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-33410</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009-12-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-29443</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2009-12-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-29436</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-29436-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2009-12-01T24:00:00</cfStartDate>
<cfFamilyNames>Emelichev</cfFamilyNames>
<cfFirstNames>Vladimir</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-33410</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-33410-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2009-12-01T24:00:00</cfStartDate>
<cfFamilyNames>Girlich</cfFamilyNames>
<cfFirstNames>Eberhard</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-29443</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-29443-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2009-12-01T24:00:00</cfStartDate>
<cfFamilyNames>Karelkina</cfFamilyNames>
<cfFirstNames>Olga</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>