IDEAS home Printed from https://ideas.repec.org/a/ids/ijmcdm/v8y2019i1p1-12.html
   My bibliography  Save this article

A joint maxmin-lexicographic maximisation approach in fuzzy goal programming using dominance possibility and necessity criteria

Author

Listed:
  • Maged G. Iskander

Abstract

In this paper, a new approach for solving fuzzy goal programming problems is introduced. The coefficients and the aspiration level of each fuzzy goal are considered either trapezoidal or triangular fuzzy numbers. Four dominance criteria (dominance possibility, strict dominance possibility, dominance necessity, and strict dominance necessity) are utilised for comparing the fuzzy numbers. The proposed approach is based on merging the maxmin approach and the lexicographic approach in a two-phase process. The first phase applies the maxmin technique by maximising the minimum achievement degree of the fuzzy goals. The second phase lexicographically maximises the achievement degrees of the fuzzy goals according to their preemptive priorities. This methodology provides the decision maker with the advantage of improving the results of his preemptive priority structure model by initially maximising the lowest achievement of the fuzzy goals, and hence guarantee that the ultimate achievement of any fuzzy goal will never be lower than a specific percentage of the achieved maxmin value. The suggested approach is illustrated by a numerical example.

Suggested Citation

  • Maged G. Iskander, 2019. "A joint maxmin-lexicographic maximisation approach in fuzzy goal programming using dominance possibility and necessity criteria," International Journal of Multicriteria Decision Making, Inderscience Enterprises Ltd, vol. 8(1), pages 1-12.
  • Handle: RePEc:ids:ijmcdm:v:8:y:2019:i:1:p:1-12
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=98032
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijmcdm:v:8:y:2019:i:1:p:1-12. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=350 .

    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.