Skip to content
naulon

Not checkedNot checked for notices yet.

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

Sumati Mahajan, S. K. Gupta, Izhar Ahmad and 1 more

Journal of Inequalities and Applications · 2021

doi:10.1186/s13660-021-02588-w (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Abstract 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.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.