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.

This publication has 12 references indexed in Scilit: