IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v53y2016i2d10.1007_s12597-015-0237-2.html
   My bibliography  Save this article

On solving Atanassov’s I-fuzzy linear programming problems: some variants of Angelov’s model

Author

Listed:
  • A. Aggarwal

    (University School of Basic and Applied Sciences, Guru Gobind Singh Indraprastha University)

  • I. Khan

    (University School of Basic and Applied Sciences, Guru Gobind Singh Indraprastha University)

Abstract

Angelov’s approach is the most common approach to solve Atanassov’s I-fuzzy linear programming problems. Here certain other variants of this basic model are studied. These variants are motivated by a recent study (Chandra and Aggarwal 2014) on fuzzy linear programming problems and follow very naturally from an associated bi-objective programming problem. This bi-objective programming problem aims to achieve a trade-off between the twin objectives of ‘meeting the aspiration level’ and ‘satisfaction of the given constraints’ which are defined in terms of their respective score functions. As an outcome of this study a new two phase approach to solve Atanassov’s I-fuzzy linear programming problems is obtained. Further, two additional formulations are also proposed on similar lines which also provide an efficient solution of the associated bi-objective optimization problem. These efficient solutions have a natural interpretation for the given I-fuzzy linear programming problem. A small numerical example is included as an illustration.

Suggested Citation

  • A. Aggarwal & I. Khan, 2016. "On solving Atanassov’s I-fuzzy linear programming problems: some variants of Angelov’s model," OPSEARCH, Springer;Operational Research Society of India, vol. 53(2), pages 375-389, June.
    • Handle: RePEc:spr:opsear:v:53:y:2016:i:2:d:10.1007_s12597-015-0237-2
    DOI: 10.1007/s12597-015-0237-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-015-0237-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-015-0237-2?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:spr:opsear:v:53:y:2016:i:2:d:10.1007_s12597-015-0237-2. 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.