不完全拉格朗日函数和具有(F,α,ρ,d)凸性的数学规划的鞍点判别准则(英文)  

Incomplete Lagrange Function and Saddle Point Optimality Criteria in Mathematical Programming Involving (F,α,ρ,d)-Convexity

作　　者：梁治安[1] 雷晓军[2] 王燕军[1] 

机构地区：[1]上海财经大学应用数学系,上海200433 [2]贵州师范大学铜仁学院数学系,贵州铜仁554300

出　　处：《运筹学学报》2007年第1期66-72,共7页Operations Research Transactions

基　　金：The research is supported by National Natural Science Foundation of China under Projects 10261005 and 10601030.

摘　　要：用一个不完全拉格朗日函数研究一类具有(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.

关 键 词：运筹学 不完全拉格朗日函数 鞍点 (F α ρ  d)凸 最优解 

分 类 号：O316[理学—一般力学与力学基础]