IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v35y2025i2p1-22id1.html
   My bibliography  Save this article

Solution of a bi-level linear programming problem with uncertain parameters and its application

Author

Listed:
  • Ajay Kumar Bhurjee

  • Pankaj Kumar

  • Pavan Kumar

Abstract

A bi-level linear programming problem characterized by interval uncertainty in the coefficients of both objectives and constraints is thoroughly examined. The Karush–Kuhn–Tucker (KKT) optimality conditions for interval nonlinear programming problems have been developed to address this challenge. Utilizing these conditions, the interval bi-level programming problem has been transformed into a deterministic nonlinear programming problem. Subsequently, a comprehensive methodology has been developed to solve the transformed problem. The proposed approach has been validated through numerous illustrative examples that demonstrate its successful execution. Furthermore, the developed methodology has been effectively applied to a practical problem in supply chain planning, showcasing its relevance and applicability in real-world scenarios.

Suggested Citation

  • Ajay Kumar Bhurjee & Pankaj Kumar & Pavan Kumar, 2025. "Solution of a bi-level linear programming problem with uncertain parameters and its application," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 35(2), pages 1-22.
  • Handle: RePEc:wut:journl:v:35:y:2025:i:2:p:1-22:id:1
    DOI: 10.37190/ord250201
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/ord2025vol35no2_1.pdf
    Download Restriction: no

    File URL: https://libkey.io/10.37190/ord250201?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:wut:journl:v:35:y:2025:i:2:p:1-22:id:1. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    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.