Abstract
Recently, Li and Tian described an interesting numerical method of interval quadratic programming with inequality constraints, where all coefficients in the objective function and constraints are interval numbers. In this paper, we generalize Li and Tian's method to interval quadratic programming with equality constraint, which is more difficult to handle. A practical algorithm is established via an effective transformation of interval programming to conventional mathematic programming.
Sign-in/Register to access full text options 
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.
