Open AccessStructures of the Pareto set and their reduction in bicriteria discrete problems
Author(s) -
Aleksey O. Zakharov,
Yu. V. Kovalenko
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1260/8/082007
Subject(s) - reduction (mathematics) , pareto principle , set (abstract data type) , mathematical optimization , axiom , computer science , scope (computer science) , mathematics , geometry , programming language
We investigate discrete bicriteria problems and apply to them the axiomatic approach of the Pareto set reduction proposed by V. Noghin. Values of “quantum of information” parameter are identified, that guarantee the reduction of the Pareto set with special structures. We analyze the families of the bicriteria set covering instances in the scope of the Pareto set reduction.