不完全拉格朗日函数和具有(F,α,ρ,d)凸性的数学规划的鞍点判别准则 |
| |
引用本文: | 梁治安,;雷晓军,;王燕军. 不完全拉格朗日函数和具有(F,α,ρ,d)凸性的数学规划的鞍点判别准则[J]. 运筹学杂志, 2007, 0(1): 66-72 |
| |
作者姓名: | 梁治安, 雷晓军, 王燕军 |
| |
作者单位: | [1]上海财经大学应用数学系,上海200433; [2]贵州师范大学铜仁学院数学系,贵州铜仁554300 |
| |
基金项目: | The research is supported by National Natural Science Foundation of China under Projects 10261005 and 10601030. |
| |
摘 要: | 用一个不完全拉格朗日函数研究一类具有(F,α,ρ,d)凸性假设的非线性规划问题的鞍点最优性判别准则,为了得到最优解与鞍点之间的关系,给出了(F,α,ρ,d)凸性中参数所要满足的条件.
|
关 键 词: | 运筹学 不完全拉格朗日函数 鞍点 (F,α,ρ, d)凸 最优解 |
Incomplete Lagrange Function and Saddle Point Optimality Criteria in Mathematical Programming Involving (F, α,ρ, d)-Convexity |
| |
Affiliation: | Liang Zhian,Lei Xiaojun, Wang Yanjun( Department of Applied Mathematics, Shanghai University of Finance and Economics, Shanghai 200433, China;Department of Mathematics, College of Tongren, Guizhou Normal University, Tongren, Guizhou 554300, China) |
| |
Abstract: | 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. |
| |
Keywords: | Operation research incomplete Lagrange function saddle point (F α ρ d)-convex optimal solution |
本文献已被 维普 等数据库收录! |
|