IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v71y2020i9p1479-1497.html
   My bibliography  Save this article

Optimal consistency and consensus models for interval additive preference relations: A discrete distribution perspective

Author

Listed:
  • Zhibin Wu
  • Xieyu Yang
  • Jiancheng Tu
  • Xue Chen

Abstract

To assist in the consensus reaching process, this article presents optimization models with interval additive preference relations (APRs) drawn from pairwise comparisons. First, consistency models are proposed to obtain additively consistent interval APRs for continuous and discrete scale cases, after which consensus models are established to arrive at a predefined consensus level for the two cases. These models seek to minimize the amount of preference changes and can be solved using linear or integer linear programming techniques. While the obtained solutions may not be unique, a second stage model is introduced to reduce the uncertainty degrees in the suggested preferences. Compared to existing approaches, the proposed models have two major advantages: the derived solution can be limited to the easy to understand original scales, and refined solutions can be determined using multi-stage optimization. Finally, several numerical examples are given to verify the proposed models, and several simulations are conducted to demonstrate the potential behaviour of the presented models in practical applications.

Suggested Citation

  • Zhibin Wu & Xieyu Yang & Jiancheng Tu & Xue Chen, 2020. "Optimal consistency and consensus models for interval additive preference relations: A discrete distribution perspective," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 71(9), pages 1479-1497, September.
  • Handle: RePEc:taf:tjorxx:v:71:y:2020:i:9:p:1479-1497
    DOI: 10.1080/01605682.2019.1621219
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1621219
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2019.1621219?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.

    Citations

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


    Cited by:

    1. Du, Junliang & Liu, Sifeng & Liu, Yong, 2022. "A limited cost consensus approach with fairness concern and its application," European Journal of Operational Research, Elsevier, vol. 298(1), pages 261-275.

    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:taf:tjorxx:v:71:y:2020:i:9:p:1479-1497. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.