IDEAS home Printed from https://ideas.repec.org/a/igg/jssmet/v11y2020i4p137-165.html
   My bibliography  Save this article

A Novel Approach for Solving a Fully Rough Multi-Level Quadratic Programming Problem and Its Application

Author

Listed:
  • A. A. Abohany

    (Kafrelsheikh University, Egypt)

  • Rizk Masoud Rizk-Allah

    (Menoufia University, Egypt)

  • Diana T. Mosa

    (Kafrelsheikh University, Egypt)

  • Aboul Ella Hassanien

    (Cairo Unversity, Egypt)

Abstract

The most widely used actions and decisions of the real-world tasks frequently appear as hierarchical systems. To deal with these systems, the multi-level programming problem presents the most flourished technique. However, practical situations involve some the impreciseness regarding some decisions and performances; RST provides a vital role by considering the lower and upper bounds of any aspect of uncertain decision. By preserving the advantages of it, in the present study, solving fully rough multi-level quadratic programming problems over the variables, parameters of the objective functions, and the constraints such as rough intervals are focused on. The proposed approach incorporates the interval method, slice-sum method, Frank and Wolfe algorithm, and the decomposition algorithm to reach optimal values as rough intervals. The proposed is validated by an illustrative example, and also environmental-economic power dispatch is investigated as a real application. Finally, the proposed approach is capable of handling the fully rough multi-level quadratic programming models.

Suggested Citation

  • A. A. Abohany & Rizk Masoud Rizk-Allah & Diana T. Mosa & Aboul Ella Hassanien, 2020. "A Novel Approach for Solving a Fully Rough Multi-Level Quadratic Programming Problem and Its Application," International Journal of Service Science, Management, Engineering, and Technology (IJSSMET), IGI Global, vol. 11(4), pages 137-165, October.
    • Handle: RePEc:igg:jssmet:v:11:y:2020:i:4:p:137-165
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSSMET.2020100109
    Download Restriction: no
    ---><---

    More about this item

    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:igg:jssmet:v:11:y:2020:i:4:p:137-165. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.