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
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
