Abstract
In this note, we establish sufficient and necessary global optimality conditions for fixed charge quadratic programming problem. The main theoretical tool for establishing these global optimality conditions is abstract convexity. The newly obtained sufficient condition extends the existing sufficient conditions. A numerical example is also provided to illustrate our optimality conditions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have