Abstract
In this paper we discuss convex quadratic programming problems with variable coefficients in the linear part of the objective function or/and in the right hand side of the constraints. Local and global stability statements are contained. An important global stability theorem is proved for a feneral non-linear programming problem arbitrary, where F is a continuous function over is a nonempty compact subset of E n . A possibility of calculating of a local stability set for the convex quadratic parametric programming problem is also given. This method is not based on an algorithm for quadratic programming problems.
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.
