关于一类不可微规划问题约束品性的一个注记

对一类目标函数由可微函数与凸函数之和组成、约束条件由Ⅳ的凸子集X上的可微非线性不等式组成的不可微规划问题，提出了一个Abadie型约束品性，证明了该约束品性弱于文献[1]中的两个约束品性，得到了该约束品性下的Kuhn—Tucker型最优性必要条件．所得结果推广了文献[1]中的相应结果.

A note on constraint qualifications for a class of nondifferentiable programming problems

For a class of the problem of minimizing the sum of a differentiable function and a convex function subject to a set of differentiable nonlinear inequalities on a convex subset X of Rn , an Abadie type constraint qualification is proposed. This constraint qualification has been proved to be weaker than two constraint qualifications given in [1]. The Kuhn-Tucker type necessary optimality conditions under t some of the existing resu his lts constraint qualification are derived. The research result generalizes in [1].