IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4939-3094-4_9.html
   My bibliography  Save this book chapter

UTA Methods

In: Multiple Criteria Decision Analysis

Author

Listed:
  • Yannis Siskos

    (University of Piraeus)

  • Evangelos Grigoroudis

    (Technical University of Crete)

  • Nikolaos F. Matsatsinis

    (Technical University of Crete)

Abstract

UTA methods refer to the philosophy of assessing a set of value or utility functions, assuming the axiomatic basis of MAUT and adopting the preference disaggregation principle. UTA methodology uses linear programming techniques in order to optimally infer additive value/utility functions, so that these functions are as consistent as possible with the global decision-maker’s preferences (inference principle). The main objective of this chapter is to analytically present the UTA method and its variants and to summarize the progress made in this field. The historical background and the philosophy of the aggregation-disaggregation approach are firstly given. The detailed presentation of the basic UTA algorithm is presented, including discussion on the stability and sensitivity analyses. Several variants of the UTA method, which incorporate different forms of optimality criteria, are also discussed. The implementation of the UTA methods is illustrated by a general overview of UTA-based DSSs, as well as real-world decision-making applications. Finally, several potential future research developments are discussed.

Suggested Citation

  • Yannis Siskos & Evangelos Grigoroudis & Nikolaos F. Matsatsinis, 2016. "UTA Methods," International Series in Operations Research & Management Science, in: Salvatore Greco & Matthias Ehrgott & José Rui Figueira (ed.), Multiple Criteria Decision Analysis, edition 2, chapter 0, pages 315-362, Springer.
    • Handle: RePEc:spr:isochp:978-1-4939-3094-4_9
    DOI: 10.1007/978-1-4939-3094-4_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:isochp:978-1-4939-3094-4_9. 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.