Using concave optimization methods for inexact quadratic programming problems with an application to waste management

Journal of inequalities and applications

Sumati Mahajan¹  S. Al-Homidan²  Izhar Ahmad²  S. K. Gupta³ 

[1] Department of Applied Sciences, Punjab Engineering College, 160012, Chandigarh, India;Department of Mathematics & Statistics, King Fahd University of Petroleum & Minerals, 31261, Dhahran, Kingdom of Saudi Arabia;Department of Mathematics, Indian Institute of Technology Roorkee, 247667, Roorkee, India;

关键词: Concave optimization;    Waste management;    Inexact parameters;    Quadratic programming problem;    90C70;    90C20;    90C26;    90C90;   

DOI  :  10.1186/s13660-021-02588-w

来源: Springer

【 摘 要 】

Quadratic programming is potentially capable of strategic decision making in real world problems. However, practical problems rarely conform to crisp parameters, and hence the prospects of these problems with inexact parameters are inevitably higher. The existing studies regarding public welfare schemes/ organizations reveal that their objectives end up as minimization of cost functions and are governed by linear or concave quadratic programming problems. The present study proposes a method that can be applied to concave type quadratic objective function subject to linear constraints with inexact parameters. A comparison is also drawn with existing methods to establish its simplicity and efficiency. Further, a numerical example is illustrated, and finally, a waste management problem is formulated and solved using the proposed method.

【 授权许可】

CC BY