Quantcast

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

Research paper by V. D. Noghin

Indexed on: 03 Feb '15Published on: 03 Feb '15Published in: Scientific and Technical Information Processing



Abstract

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.