The nonlinear programming (NLP) problem with one objective function f and m constraint functions c i, which are continuously differentiable, is defined as follows: In the preceding notation, n is the ...

In this paper we study necessary optimality conditions for the problem of minimizing a polynomial function over a set defined by polynomial inequalities. Assume that the problem is bounded below and ...