摘要
通过抽象凸分析理论,给出了带有不等式约束的非线性规划问题的全局最优充分性条件。并利用(L,X)一次微分给出了目标函数是连续可微,约束函数不必是连续可微的极小化问题的全局最优性充分条件。
In this paper, we present the sufficient global optimality condition for nonlinear programming problem with inequality constraints by using abstract convex analysis theory and the global optimality condition for minimization problems that object function is continuously differentiable and constraint function is not necessarily continuously differentiable by （L,X） once differentiation.
出处
《长春大学学报》
2008年第10期17-19,共3页
Journal of Changchun University
基金
重庆市教委资助项目(KJ070816)
教育部科学技术重点项目(No.206123)
关键词
全局最优
最优性条件
(L
X)一次微分
global optimum
optimality condition
（L,X） once differentiation
