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

Bi-objective optimisation with multiple decision-makers: a convex approach to attain majority solutions

Author

Listed:
  • S L C Oliveira

    (University of Campinas)

  • P A V Ferreira

    (University of Campinas)

Abstract

An interactive approach for solving bi-objective optimisation problems with multiple decision-makers in a context where the decisions are made via the strict majority voting rule is proposed. An adequate use of projection and decomposition techniques leads to a hierarchical algorithm in which the upper level is represented by a relaxed version of the bi-objective problem in the objective space. The feasibility of the partial consensus obtained in the upper (decision) level by the strict majority voting rule is tested in the lower (analysis) level of the algorithm. Some properties of the relaxed bi-objective problem allow that different preference structures of the decision-makers can be represented by appropriate multiobjective methods. The paper includes numerical examples that illustrate the characteristics of the approach proposed.

Suggested Citation

  • S L C Oliveira & P A V Ferreira, 2000. "Bi-objective optimisation with multiple decision-makers: a convex approach to attain majority solutions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(3), pages 333-340, March.
    • Handle: RePEc:pal:jorsoc:v:51:y:2000:i:3:d:10.1057_palgrave.jors.2600918
    DOI: 10.1057/palgrave.jors.2600918
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600918
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600918?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. Marchant, Thierry, 2007. "An axiomatic characterization of different majority concepts," European Journal of Operational Research, Elsevier, vol. 179(1), pages 160-173, May.
    2. Sven Leyffer, 2009. "A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 21(2), pages 257-267, May.

    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:51:y:2000:i:3:d:10.1057_palgrave.jors.2600918. 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.