IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v34y1986i5p726-731.html
   My bibliography  Save this article

A Progressive Algorithm for Modeling and Solving Multiple-Criteria Decision Problems

Author

Listed:
  • Pekka Korhonen

    (Helsinki School of Economics, Helsinki, Finland)

  • Herbert Moskowitz

    (Purdue University, West Lafayette, Indiana, and the London Business School, London, England)

  • Jyrki Wallenius

    (Arizona State University, Tempe, Arizona, and the University of Jyvaskyla, Finland)

Abstract

We consider a decision maker (DM) who has a set of possible decision alternatives, from which one (a “best”) is to be chosen. However, all decision alternatives are not at the DM's disposal initially, nor is full knowledge of his/her utility/value function. Therefore, the DM evaluates only the available subset of all decision alternatives, from which he/she chooses a most preferred one. Obviously, this decision is not necessarily “globally” best. Two natural questions arise: How good is the most preferred solution? What are the chances of finding better solutions by considering additional alternatives? We describe and illustrate a general progressive algorithm and the supporting theory for modeling and solving this problem when alternatives are introduced dynamically.

Suggested Citation

  • Pekka Korhonen & Herbert Moskowitz & Jyrki Wallenius, 1986. "A Progressive Algorithm for Modeling and Solving Multiple-Criteria Decision Problems," Operations Research, INFORMS, vol. 34(5), pages 726-731, October.
    • Handle: RePEc:inm:oropre:v:34:y:1986:i:5:p:726-731
    DOI: 10.1287/opre.34.5.726
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.34.5.726
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.34.5.726?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
    ---><---

    Citations

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


    Cited by:

    1. Chun, Young H. & Sumichrast, Robert T., 2006. "A rank-based approach to the sequential selection and assignment problem," European Journal of Operational Research, Elsevier, vol. 174(2), pages 1338-1344, October.
    2. Y H Chun, 2004. "Generalized best choice problem based on the information economics approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 988-999, September.
    3. Pekka Salminen & Jeffrey E. Teich & Jyrki Wallenius, 1998. "The Secretary Problem Revisited - The Group Decision-Making Perspective," Group Decision and Negotiation, Springer, vol. 7(1), pages 3-21, January.
    4. Soleimani-damaneh, Majid & Pourkarimi, Latif & Korhonen, Pekka J. & Wallenius, Jyrki, 2021. "An operational test for the existence of a consistent increasing quasi-concave value function," European Journal of Operational Research, Elsevier, vol. 289(1), pages 232-239.
    5. Ankur Sinha & Pekka Korhonen & Jyrki Wallenius, 2016. "Finding better alternatives than those considered in a multiple criteria data sample," Journal of Business Economics, Springer, vol. 86(1), pages 35-54, January.
    6. Nikolaos Argyris & Alec Morton & José Rui Figueira, 2014. "CUT: A Multicriteria Approach for Concavifiable Preferences," Operations Research, INFORMS, vol. 62(3), pages 633-642, June.
    7. Nasim Nasrabadi & Akram Dehnokhalaji & Pekka Korhonen & Jyrki Wallenius, 2019. "Using convex preference cones in multiple criteria decision making and related fields," Journal of Business Economics, Springer, vol. 89(6), pages 699-717, August.
    8. Canan Ulu & Murat Köksalan, 2001. "An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(7), pages 592-606, October.
    9. Stein, William E. & Seale, Darryl A. & Rapoport, Amnon, 2003. "Analysis of heuristic solutions to the best choice problem," European Journal of Operational Research, Elsevier, vol. 151(1), pages 140-152, November.
    10. Lahdelma, Risto & Salminen, Pekka & Kuula, Markku, 2003. "Testing the efficiency of two pairwise comparison methods in discrete multiple criteria problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 496-508, March.
    11. Chun, Young H., 2015. "Multi-attribute sequential decision problem with optimizing and satisficing attributes," European Journal of Operational Research, Elsevier, vol. 243(1), pages 224-232.

    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:inm:oropre:v:34:y:1986:i:5:p:726-731. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.