Solution of a bi-level linear programming problem with uncertain parameters and its application
In this paper, 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...
Uloženo v:
| Vydáno v: | Operations research and decisions Ročník 35; číslo 2; s. 1 - 22 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Wrocław University of Science and Technology
2025
|
| ISSN: | 2081-8858, 2391-6060 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper, 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. (original abstract) |
|---|---|
| AbstractList | In this paper, 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. (original abstract) |
| Author | Kumar Bhurjee, Ajay Kumar, Pankaj Kumar, Pavan |
| Author_xml | – sequence: 1 givenname: Ajay surname: Kumar Bhurjee fullname: Kumar Bhurjee, Ajay – sequence: 2 givenname: Pankaj surname: Kumar fullname: Kumar, Pankaj – sequence: 3 givenname: Pavan surname: Kumar fullname: Kumar, Pavan |
| BookMark | eNo9kE1LAzEYhINUsNZe_AU5C6v52k1ylOJHoeBBPS_vJm9qZLtZslvFf-_WSk8zDMPDMJdk1qUOCbnm7FZqbtldyl6UTDB-RuZCWl5UrGKzyTPDC2NKc0GWwxAbJiqrecn4nNSvqd2PMXU0BQq0iUWLX9jSNnYImfY5bTPsdrHbHnzT4o5-x_GD7juHeYTY0R6mAo6YBwqdp3GctO_b6OCAvSLnAdoBl_-6IO-PD2-r52Lz8rRe3W8KJ6waixBM5ZX1Uko0jqHSGrUtxTQzVAYRg7DCh1Io70yDAphRAbxWjbKSeSEXZH3k-gSfdZ_jDvJPnSDWf0HK2xryGF2LNRNNCVIqzblU4KWpmsYxIzVTwXIwE-vmyHI5DUPGcOJxVv89XZ-elr-Th3OV |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.37190/ord250201 |
| DatabaseName | CrossRef DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 2391-6060 |
| EndPage | 22 |
| ExternalDocumentID | oai_doaj_org_article_02b5a33471134ad386bbc083704f91a8 10_37190_ord250201 |
| GroupedDBID | AAYXX ADBBV ADMLS AHQJS AKVCP ALMA_UNASSIGNED_HOLDINGS BCNDV CITATION EBO EBU EOJEC GROUPED_DOAJ KQ8 OBODZ RNS TH9 Y2W ~8M |
| ID | FETCH-LOGICAL-c294t-ff86d49d333e8c0e477e7952971f68eeef292df524dc8be2a084fad74b4930d23 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001499273100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2081-8858 |
| IngestDate | Fri Oct 03 12:47:21 EDT 2025 Sat Nov 29 06:11:57 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c294t-ff86d49d333e8c0e477e7952971f68eeef292df524dc8be2a084fad74b4930d23 |
| OpenAccessLink | https://doaj.org/article/02b5a33471134ad386bbc083704f91a8 |
| PageCount | 22 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_02b5a33471134ad386bbc083704f91a8 crossref_primary_10_37190_ord250201 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-00-00 2025-01-01 |
| PublicationDateYYYYMMDD | 2025-01-01 |
| PublicationDate_xml | – year: 2025 text: 2025-00-00 |
| PublicationDecade | 2020 |
| PublicationTitle | Operations research and decisions |
| PublicationYear | 2025 |
| Publisher | Wrocław University of Science and Technology |
| Publisher_xml | – name: Wrocław University of Science and Technology |
| SSID | ssib026971501 ssj0001141500 |
| Score | 2.2787564 |
| Snippet | In this paper, a bi-level linear programming problem characterized by interval uncertainty in the coefficients of both objectives and constraints is thoroughly... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| StartPage | 1 |
| Title | Solution of a bi-level linear programming problem with uncertain parameters and its application |
| URI | https://doaj.org/article/02b5a33471134ad386bbc083704f91a8 |
| Volume | 35 |
| WOSCitedRecordID | wos001499273100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2391-6060 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001141500 issn: 2081-8858 databaseCode: DOA dateStart: 20100101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07a8MwEBYldGiH0idNXwjaVcSWZEs3JqWhQxsyNJDNyHpAhjolSfv7e5Lz2rp0M8YY892hT3c-fR8hTy44XHnzmpnSGyZ9AFZ7MMzIGjxY46SRyWxCjUZ6OoXxntVXnAlr5YFb4HoZrwsjBK6huZDGCV3Wtc2iZIsMkJt0zDdTsFdMYSbxEhTudPJdtyVHokrnUThyINO60K1WqVDIiD2s83ArwNfOMBt22hPxT2wzPCUn620i7befd0YOfHNOjt-3GqvLC1JtOlp0Hqihgxl7iwNAFKtLzF46bgevPpGa4nV0jaGx6UonGOY0BkDHJk5mRXlNahpHZ6sl7e_-Z1-SyfDl4_mVre0SmOUgVywEXToJTgjhtc28VMorKDhCEUrtvQ8cuAsFl87q2nOTaRmMU7KWIDLHxRXpNPPGXxOKNYmEoJV1ykgRBFiQKmCtaE3wmYAuedzAVH21qhgVVhMJzGoLZpcMIoLbJ6KSdbqB8a3W8a3-iu_Nf7zklhzx6NubWid3pLNafPt7cmh_VrPl4iGlzi9e9cY4 |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Solution+of+a+bi-level+linear+programming+problem+with+uncertain+parameters+and+its+application&rft.jtitle=Operations+research+and+decisions&rft.au=Kumar+Bhurjee%2C+Ajay&rft.au=Kumar%2C+Pankaj&rft.au=Kumar%2C+Pavan&rft.date=2025&rft.issn=2081-8858&rft.eissn=2391-6060&rft.volume=35&rft.issue=2&rft_id=info:doi/10.37190%2Ford250201&rft.externalDBID=n%2Fa&rft.externalDocID=10_37190_ord250201 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2081-8858&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2081-8858&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2081-8858&client=summon |