TY - JOUR

T1 - Reducing the pareto set algorithm based on an arbitrary finite set of information “quanta”

AU - Noghin, V.D.

PY - 2014

Y1 - 2014

N2 - © 2014, Allerton Press, Inc. In this paper, in the framework of the axiomatic approach developed by the author over the past 3 decades, we assume four axioms of “reasonable” choice, which define a rather wide class of problems of multi-criteria selection. To reduce the Pareto set we use numerical information about the preference relation of a decision maker. We propose a method for narrowing the Pareto set using an arbitrary consistent finite set of such information. The method is based on an algorithm that generates a new set of criteria (with a minimum elements number) with respect to which a new Pareto set gives o more precise upper estimate than the initial Pareto set.

AB - © 2014, Allerton Press, Inc. In this paper, in the framework of the axiomatic approach developed by the author over the past 3 decades, we assume four axioms of “reasonable” choice, which define a rather wide class of problems of multi-criteria selection. To reduce the Pareto set we use numerical information about the preference relation of a decision maker. We propose a method for narrowing the Pareto set using an arbitrary consistent finite set of such information. The method is based on an algorithm that generates a new set of criteria (with a minimum elements number) with respect to which a new Pareto set gives o more precise upper estimate than the initial Pareto set.

U2 - 10.3103/S0147688214050086

DO - 10.3103/S0147688214050086

M3 - Article

SP - 309

EP - 313

JO - Scientific and Technical Information Processing

JF - Scientific and Technical Information Processing

SN - 0147-6882

IS - 5

ER -