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
id doaj-cad4edd5c28c4cea9476898d753c19df
record_format Article
spelling doaj-cad4edd5c28c4cea9476898d753c19df2021-07-28T16:20:21ZrusEstablishment «The Main Information and Analytical Center of the Ministry of Education of the Republic of Belarus»Цифровая трансформация2522-96132524-28222017-12-0101s849410Algorithm of finding a set of Pareto on a final set of initial dataS. V. Chebakov0L. V. Serebryanaya1Объединенный институт проблем информатики Национальной академии наук БеларусиБелорусский государственный университет информатики и радиоэлектроники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 backtracking algorithms. An iterative algorithm for constructing the Pareto set is proposed.https://dt.giac.by/jour/article/view/10
collection DOAJ
language Russian
format Article
sources DOAJ
author S. V. Chebakov
L. V. Serebryanaya
spellingShingle S. V. Chebakov
L. V. Serebryanaya
Algorithm of finding a set of Pareto on a final set of initial data
Цифровая трансформация
author_facet S. V. Chebakov
L. V. Serebryanaya
author_sort S. V. Chebakov
title Algorithm of finding a set of Pareto on a final set of initial data
title_short Algorithm of finding a set of Pareto on a final set of initial data
title_full Algorithm of finding a set of Pareto on a final set of initial data
title_fullStr Algorithm of finding a set of Pareto on a final set of initial data
title_full_unstemmed Algorithm of finding a set of Pareto on a final set of initial data
title_sort algorithm of finding a set of pareto on a final set of initial data
publisher Establishment «The Main Information and Analytical Center of the Ministry of Education of the Republic of Belarus»
series Цифровая трансформация
issn 2522-9613
2524-2822
publishDate 2017-12-01
description 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 backtracking algorithms. An iterative algorithm for constructing the Pareto set is proposed.
url https://dt.giac.by/jour/article/view/10
work_keys_str_mv AT svchebakov algorithmoffindingasetofparetoonafinalsetofinitialdata
AT lvserebryanaya algorithmoffindingasetofparetoonafinalsetofinitialdata
_version_ 1721267561856761856

Similar Items