IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i6d10.1057_palgrave.jors.2601349.html
   My bibliography  Save this article

Determining compromise weights for group decision making

Author

Listed:
  • H Yan

    (The Hong Kong Polytechnic University)

  • Q Wei

    (Institute of Operations Research and Mathematical Economics, Renmin University of China)

Abstract

In our early work, we described a minimax principle based procedure of preference adjustments with a finite number of steps to find compromise weights. The weights are obtained by solving a linear programming (LP) problem. The objective value of the LP is called a compromise index. When the index is non-negative, compromise weights are determined; otherwise we identify a set of ‘worst preference orders’ according to the optimal solution of the LP, for adjustment. However, this ‘worst preference order’ set depends on the selection of corresponding optimal solutions. This may have a negative impact on the decision-making procedure. This paper thoroughly discusses the problem of the existence of multiple optimal solutions. We define a set of ‘very worst preference order’, which is independent of the selection of optimal solutions. We prove that compromise weights can be achieved within a finite number of adjustments on preference orders. Numerical examples are given for illustration.

Suggested Citation

  • H Yan & Q Wei, 2002. "Determining compromise weights for group decision making," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(6), pages 680-687, June.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:6:d:10.1057_palgrave.jors.2601349
    DOI: 10.1057/palgrave.jors.2601349
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601349
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601349?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:pal:jorsoc:v:53:y:2002:i:6:d:10.1057_palgrave.jors.2601349. 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.palgrave-journals.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.