IDEAS home Printed from
   My bibliography  Save this paper

An Algorithm for Projecting a Reference Direction onto the Nondominated Set of Given Points


  • P. Korhonen
  • J. Karaivanova


In this paper, we consider the problem of searching nondominated alternatives in a discrete multiple criteria problem. The search procedure is based on the use of a reference direction. A reference direction reflects the desire of the decision maker (DM) to specify a search direction. To find a set of given alternatives related somehow to the reference direction specified by the DM, the reference direction has to be projected onto the set of nondominated alternatives. Our purpose is to develop an efficient algorithm for making this projection. The projection of each given reference direction determines a nondominated ordered subset. The set is provided to a decision maker for evaluation. The decision maker will choose the most preferred alternative from this subset and continues the search from this alternative with a new reference direction. The search will end when no direction of of improvement is found. A critical point in the procedure is the efficiency of the projection operation. This efficiency of our algorithm is considered theoretically and numerically. The projection is made by parametrizing an achievement scalarizing function originally proposed by Wierzbicki (1980) to project any single point onto the nondominated set.

Suggested Citation

  • P. Korhonen & J. Karaivanova, 1998. "An Algorithm for Projecting a Reference Direction onto the Nondominated Set of Given Points," Working Papers ir98011, International Institute for Applied Systems Analysis.
  • Handle: RePEc:wop:iasawp:ir98011

    Download full text from publisher

    File URL:
    Download Restriction: no

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Pekka Korhonen & Jyrki Wallenius & Stanley Zionts, 1984. "Solving the Discrete Multiple Criteria Problem using Convex Cones," Management Science, INFORMS, vol. 30(11), pages 1336-1345, November.
    2. Odile Marcotte & Richard M. Soland, 1986. "An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization," Management Science, INFORMS, vol. 32(1), pages 61-75, January.
    3. Korhonen, Pekka, 1988. "A visual reference direction approach to solving discrete multiple criteria problems," European Journal of Operational Research, Elsevier, vol. 34(2), pages 152-159, March.
    4. Korhonen, Pekka J., 1986. "A hierarchical interactive method for ranking alternatives with multiple qualitative criteria," European Journal of Operational Research, Elsevier, vol. 24(2), pages 265-276, February.
    5. Korhonen, Pekka J. & Laakso, Jukka, 1986. "A visual interactive method for solving the multiple criteria problem," European Journal of Operational Research, Elsevier, vol. 24(2), pages 277-287, February.
    6. Stanley Zionts & Jyrki Wallenius, 1976. "An Interactive Programming Method for Solving the Multiple Criteria Problem," Management Science, INFORMS, vol. 22(6), pages 652-663, February.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Jyrki Wallenius & James S. Dyer & Peter C. Fishburn & Ralph E. Steuer & Stanley Zionts & Kalyanmoy Deb, 2008. "Multiple Criteria Decision Making, Multiattribute Utility Theory: Recent Accomplishments and What Lies Ahead," Management Science, INFORMS, vol. 54(7), pages 1336-1349, July.
    2. Sinha, Ankur & Korhonen, Pekka & Wallenius, Jyrki & Deb, Kalyanmoy, 2014. "An interactive evolutionary multi-objective optimization algorithm with a limited number of decision maker calls," European Journal of Operational Research, Elsevier, vol. 233(3), pages 674-688.
    3. Pekka Korhonen & Margareta Soismaa & Aapo Siljamäki, 2002. "On the Use of Value Efficiency Analysis and Some Further Developments," Journal of Productivity Analysis, Springer, vol. 17(1), pages 49-64, January.

    More about this item


    Access and download statistics


    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:wop:iasawp:ir98011. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel). General contact details of provider: .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.