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

S. V. Chebakov and L. V. Serebryanaya

Digital Transformation, 2017, issue 1s

Abstract: 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.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
https://dt.bsuir.by/jour/article/viewFile/10/11 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:abx:journl:y:2017:id:10

Access Statistics for this article

More articles in Digital Transformation from Educational Establishment “Belarusian State University of Informatics and Radioelectronicsâ€
Bibliographic data for series maintained by Ð ÐµÐ´Ð°ÐºÑ†Ð¸Ñ ().