Solving quadratic programming problems through a fully rough scheme and its applications Online publication date: Tue, 04-Jan-2022
by Amr A. Abohany; Rizk M. Rizk-Allah; Diana T. Mousa; Aboul Ella Hassanien
International Journal of Mathematics in Operational Research (IJMOR), Vol. 20, No. 3, 2021
Abstract: Real-life problems are generally solved with some uncertain parameters. Naturally, these parameters may be determined based on the opinions of experts. Therefore, all consenting and opposing opinions should be considered. This works aims to present an approach for solving quadratic programming (QP) problems. The proposed approach combines the merits of the slice sum method (SSM), linearisation, and the Frank and Wolfe algorithm to find optimal solutions. The proposed approach has two features: first, it elicits four crisp problems from the fully rough QP (FRQP) problem using the SSM. Second, the proposed method employs a linearised Frank and Wolfe algorithm for solving crisp problems. Finally, a numerical example and a case study of the economic dispatch (ED) problem of a power system are investigated. The obtained results prove that the proposed methodology can serve as a significant tool for decision-makers to handle several types of logistic problems with rough parameters.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook