IDEAS home Printed from https://ideas.repec.org/a/abx/journl/y2017id10.html
   My bibliography  Save this article

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

Author

Listed:
  • S. V. Chebakov
  • L. V. Serebryanaya

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.

Suggested Citation

  • S. V. Chebakov & L. V. Serebryanaya, 2017. "Algorithm of finding a set of Pareto on a final set of initial data," Digital Transformation, Educational Establishment “Belarusian State University of Informatics and Radioelectronicsâ€, issue 1s.
    • Handle: RePEc:abx:journl:y:2017:id:10
    as

    Download full text from publisher

    File URL: https://dt.bsuir.by/jour/article/viewFile/10/11
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:abx:journl:y:2017:id:10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Ð ÐµÐ´Ð°ÐºÑ†Ð¸Ñ (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.