摘要
本文进一步讨论了由Antczak提出的η-逼近方法[1],它是为了解决包含有关于同一个函数η的不变凸函数的非线性约束数学规划问题.在这种方法中,我们定义了与最初数学规划相关的η-逼近优化问题和η-鞍点、η-拉格朗日函数,最后,我们证明了η-逼近优化问题中的η-鞍点最优性条件.
In this paper, the η- approximation method introduced by Antczak[1] for solving a nonlinear constrained mathematical programming problem involving invex functions with respect to the same function η-is extended. In this method, a so-called η- approxi mation optimization problem associated with the original mathematical programming problems is constructed; moreover, an-saddle point an η- agrange function are defined. By the help of the eonstrccted η- approximation optimization problem, saddle-point criteria are obtained for the original mathematical programming problem.
出处
《山西师范大学学报（自然科学版）》
2011年第3期30-34,共5页
Journal of Shanxi Normal University(Natural Science Edition)
关键词
η-逼近优化问题
η-鞍点
η-拉格朗日函数
η-不变凸函数
最优性
η- approximation optimization problem
η- saddle point
η- Lagrange function
invex function with respect to r/
op-timality
