Stability of a combinatorial vector partition problem

The vector variant of the partition problem is considered. It is shown that the coincidence of the Pareto and Slater sets is the necessary and sufficient condition of stability of the problem with respect to its functional. [PUBLICATION ABSTRACT]

Saved in:
Bibliographic Details
Published inCybernetics and systems analysis Vol. 43; no. 3; pp. 462 - 465
Main Authors Emelichev, V. A., Gurevskii, E. E.
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.05.2007
Subjects
Equality
Linear programming
Multiple criteria decision making
Pareto optimum
Theorems
Theory
Online AccessGet full text
ISSN1060-0396
1573-8337
DOI10.1007/s10559-007-0071-5

Cover

More Information
Summary:The vector variant of the partition problem is considered. It is shown that the coincidence of the Pareto and Slater sets is the necessary and sufficient condition of stability of the problem with respect to its functional. [PUBLICATION ABSTRACT]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-007-0071-5