用一个不完全拉格朗日函数研究一类具有(F,α,ρ,d)凸性假设的非线性规划问题的鞍点最优性判别准则,为了得到最优解与鞍点之间的关系,给出了(F,α,ρ,d)凸性中参数所要满足的条件.
An incomplete Lagrange function is used to study saddle point optimality criteria for a class of nonlinear programming problems involving (F,α,ρ, d)-convexity assumptions. Conditions for the parameters of (F, α,ρ, d)-convexity are given to establish the relationship between optimal solution and saddle points.