IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v103y1999i1d10.1023_a1021737819929.html
   My bibliography  Save this article

Modified Algorithm to Compute Pareto-Optimal Vectors

Author

Listed:
  • V. N. Sastry

    (Regional Engineering College, Tiruchirappalli)

  • S. Ismail Mohideen

    (Jamal Mohamed College)

Abstract

Finding Pareto-minimum vectors among r given vectors, each of dimension m, is a fundamental problem in multiobjective optimization problems or multiple-criteria decision-making problems. Corley and Moon (Ref. 1) have given an algorithm for finding all the Pareto-minimum paths of a multiobjective network optimization problem from the initial node to any other node. It uses another algorithm by Corley and Moon, which actually computes the Pareto-minimum vectors. We observed that the latter algorithm is incorrect. In this note, we correct the algorithm for computing Pareto-minimum vectors and present a modified algorithm.

Suggested Citation

  • V. N. Sastry & S. Ismail Mohideen, 1999. "Modified Algorithm to Compute Pareto-Optimal Vectors," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 241-244, October.
    • Handle: RePEc:spr:joptap:v:103:y:1999:i:1:d:10.1023_a:1021737819929
    DOI: 10.1023/A:1021737819929
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021737819929
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021737819929?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:joptap:v:103:y:1999:i:1:d:10.1023_a:1021737819929. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.