当前位置: X-MOL 学术J. Inequal. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Using concave optimization methods for inexact quadratic programming problems with an application to waste management
Journal of Inequalities and Applications ( IF 1.5 ) Pub Date : 2021-03-31 , DOI: 10.1186/s13660-021-02588-w
Sumati Mahajan , S. K. Gupta , Izhar Ahmad , S. Al-Homidan

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.

中文翻译:

使用凹面优化方法解决不精确的二次规划问题及其在废物管理中的应用

二次编程有可能在现实世界中的问题上做出战略决策。但是,实际问题很少符合清晰的参数,因此这些参数不精确的问题的前景不可避免地更高。现有的有关公共福利计划/组织的研究表明,其目标最终是使成本函数最小化,并受线性或凹二次规划问题的支配。本研究提出了一种方法,该方法可以应用于具有不精确参数的线性约束的凹型二次目标函数。还对现有方法进行了比较,以确定其简单性和效率。进一步,举例说明了一个数值示例,最后,使用提出的方法制定并解决了废物管理问题。
更新日期:2021-03-31
down
wechat
bug