Year-end Sale % OFF 
Abstract
One of the fundamental problems in interval quadratic programming is to compute the range of optimal values. In this paper, we derive some results on the lower bound of interval convex quadratic programming. We first develop complementary slackness conditions of a quadratic program and its Dorn dual. Then, some interesting and useful characteristics of the lower bound of interval quadratic programming are established based on these conditions. Finally, illustrative examples and remarks are given to get an insight into the problem discussed.
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.
