IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v16y2020i3p354-375.html
   My bibliography  Save this article

Analysing interval and multi-choice bi-level programming for Stackelberg game using intuitionistic fuzzy programming

Author

Listed:
  • Sumit Kumar Maiti
  • Sankar Kumar Roy

Abstract

The aim of this paper is to provide a computational algorithm for solving interval-valued and multi-choice bi-level programming for Stackelberg game using intuitionistic fuzzy approach. It also includes the cost parameters of upper and lower-level objective functions corresponding to interval numbers and multi-choice types while the parameters of constraints are intuitionistic fuzzy numbers. The interval-valued and multi-choice types objective functions are converted into deterministic form using interval programming and a general transformation technique respectively. Again, the intuitionistic fuzzy parameters of constraints are reduced to an interval by taking expected value of intuitionistic fuzzy number. A conflicting nature between the objective functions is resolved with the help of intuitionistic fuzzy programming by considering nonlinear degree of membership and non-membership functions respectively. The resultant max-min problem is solved with LINGO 15.0 iterative scheme. The developed algorithm is illustrated by an application example and Pareto optimality test is performed as well. The conclusions and an outlook of future study are described at last.

Suggested Citation

  • Sumit Kumar Maiti & Sankar Kumar Roy, 2020. "Analysing interval and multi-choice bi-level programming for Stackelberg game using intuitionistic fuzzy programming," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 16(3), pages 354-375.
    • Handle: RePEc:ids:ijmore:v:16:y:2020:i:3:p:354-375
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=106919
    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:ijmore:v:16:y:2020:i:3:p:354-375. 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=320 .

    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.