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

A bi-level multi-choice programming problem

Author

Listed:
  • Avik Pradhan
  • M.P. Biswal

Abstract

A bi-level linear programming problem is treated as a multi-objective optimisation problem where the decision is taken by two different decision makers who are at two different levels. In this paper we consider a bi-level linear programming problem where some of the cost coefficient of the objectives, and some of the right hand side parameters of the constraints are multi-choice parameters. The aim of this paper is to establish a suitable solution procedure to solve the stated bi-level programming problem. To tackle the multi-choice parameters of the bi-level programming problem, we use some interpolating polynomials. Multi-choice parameters are replaced with interpolating polynomials. Then we use fuzzy programming method to solve the transformed bi-level programming problem. We present a numerical example to illustrate the solution procedure of the bi-level linear programming problem involving some multi-choice parameters.

Suggested Citation

  • Avik Pradhan & M.P. Biswal, 2015. "A bi-level multi-choice programming problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 7(1), pages 1-18.
    • Handle: RePEc:ids:ijmore:v:7:y:2015:i:1:p:1-18
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=65945
    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:7:y:2015:i:1:p:1-18. 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.