<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Emelichev, V.A.</creatorName>
<affiliation>Universitatea de Stat din Belarus, Belarus</affiliation>
</creator>
<creator>
<creatorName>Karelkina, O.V.</creatorName>
<affiliation>Universitatea de Stat din Belarus, Belarus</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Postoptimal analysis of one lexicographic
combinatorial problem with non-linear criteria</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2009</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1561-4042</relatedIdentifier>
<subjects>
<subject>multicriteria combinatorial problem</subject>
<subject>lexicographic set</subject>
<subject>quasi-stability</subject>
<subject>binary relations</subject>
<subject>perturbing matrix</subject>
<subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>004:[519.613+519.853]</subject>
</subjects>
<dates>
<date dateType='Issued'>2009-01-05</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>In this article we consider a multicriteria combinatorial problem with ordered MINMIN criteria. We obtain necessary and
 su±cient 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</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>