Abstract
There are several methods to compute the optimal bounds of the objective function for interval quadratic programming (IQP) problems, but no method has yet been suggested to calculate a set of optimal solutions of IQP problems. This paper presents an accurate set of optimal solutions for the interval quadratic programming problems. The optimal solution of the quadratic programming problem is not essentially an extreme point. We rst propose conditions that make the optimal solutions of the IQP to extreme points and then, using these conditions, we compute the exact set of optimal solutions for the IQP problem.
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.
