IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i8p1242-d1631465.html
   My bibliography  Save this article

Two TOPSIS-Based Approaches for Multi-Choice Rough Bi-Level Multi-Objective Nonlinear Programming Problems

Author

Listed:
  • Mohamed A. El Sayed

    (Basic Sciences Department, Faculty of Engineering, BADR University in Cairo BUC, Cairo 11829, Egypt
    Department of Basic Engineering Sciences, Faculty of Engineering, Benha University, Banha 13511, Egypt)

  • Farahat A. Farahat

    (Higher Technological Institute, Tenth of Ramadan City 44629, Egypt)

  • Mohamed A. Elsisy

    (Department of Basic Engineering Sciences, Faculty of Engineering, Benha University, Banha 13511, Egypt)

  • Maazen Alsabaan

    (Department of Computer Engineering, College of Computer and Information Sciences, King Saud University, P.O. Box 51178, Riyadh 11543, Saudi Arabia)

  • Mohamed I. Ibrahem

    (School of Computer and Cyber Sciences, Augusta University, Augusta, GA 30912, USA)

  • Haitham Elwahsh

    (Faculty of Information Technology, Applied Science Private University, Amman 11931, Jordan
    Department of Computer Science, Faculty of Computers and Information, Kafrelsheikh University, Kafrelsheikh 33516, Egypt)

Abstract

The multi-choice rough bi-level multi-objective nonlinear programming problem (MR-BLMNPP) has noticeably risen in various real applications. In the current model, the objective functions have a multi-choice parameter, and the constraints are represented as a rough set. In the first phase, Newton divided differences (NDDs) are utilized to formulate a polynomial of the objective functions. Then, based on the rough set theory, the model is converted into an Upper Approximation Model (UAM) and Lower Approximation Model (LAM). In the second phase, two Technique of Order Preferences by Similarity to Ideal Solution (TOPSIS)-based models are presented to solve the MR-BLMNPP. A TOPSIS-based fuzzy max–min and fuzzy goal programming (FGP) model are applied to tackle the conflict between the modified bi-objective distance functions. An algorithm for solving MR-BLNPP is also presented. The applicability and efficiency of the two TOPSIS-based models suggested in this study are presented through an algorithm and a numerical illustration. Finally, the study presents a bi-level production planning model (BL-PPM) as an illustrative application.

Suggested Citation

  • Mohamed A. El Sayed & Farahat A. Farahat & Mohamed A. Elsisy & Maazen Alsabaan & Mohamed I. Ibrahem & Haitham Elwahsh, 2025. "Two TOPSIS-Based Approaches for Multi-Choice Rough Bi-Level Multi-Objective Nonlinear Programming Problems," Mathematics, MDPI, vol. 13(8), pages 1-23, April.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:8:p:1242-:d:1631465
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/8/1242/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/8/1242/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:8:p:1242-:d:1631465. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.