Abstract
We consider the interval quadratic programming problems. The aim of this paper is to present a new method to compute the upper bound of the optimal values, under weaker conditions. Moreover, we discuss the relations between the new method and previous results. The features of the proposed methods are illustrated by some examples.
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.
