DC programming: Overview

被引:493
作者
Horst, R [1 ]
Thoai, NV [1 ]
机构
[1] Univ Trier, Dept Math, Trier, Germany
关键词
DC functions; DC programming; global optimization; nonconvex programming; optimality conditions;
D O I
10.1023/A:1021765131316
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Mathematical programming problems dealing with functions, each of which can be represented as a difference of two convex functions, are called DC programming problems. The purpose of this overview is to discuss main theoretical results, some applications, and solution methods for this interesting and important class of programming problems. Some modifications and new results on the optimality conditions and development of algorithms are also presented.
引用
收藏
页码:1 / 43
页数:43
相关论文
共 61 条