摘要
本文研究一类特殊的DC规划,给出该类DC规划的最优性条件,并利用凸函数性质获得了这类DC规划全局最优解的充要条件.
A class of DC programming is studied in this article. Optimality conditions are investigated, and the necessary and sufficient conditions of this DC programming are acquired by using the properties of convex function.
出处
《枣庄学院学报》
2012年第5期1-3,共3页
Journal of Zaozhuang University
关键词
DC规划
最优性条件
凸函数
全局最优解
DC programming
optimality conditions
convex function
global optimal solution
