Algorithm of finding a set of Pareto on a final set of initial data

Algorithm of finding a set of Pareto on a final set of initial data

A two-stage algorithm for solving the optimization task for finding the Pareto set on a given finite set of initial data N is proposed. A method is developed for finding a subset of dominated elements of the initial set N by constructing the Pareto layers on two-criterial subspaces that does not use...

Full description

Bibliographic Details
Main Authors: S. V. Chebakov, L. V. Serebryanaya
Format: Article
Language:Russian
Published: Establishment «The Main Information and Analytical Center of the Ministry of Education of the Republic of Belarus» 2017-12-01
Series:Цифровая трансформация
Online Access:https://dt.giac.by/jour/article/view/10

Similar Items

Similar Items