Optimality conditions for DC programming problems with reverse convex constraints

被引：9
|
作者：
Saeki, Yusuke [1 ]
Kuroiwa, Daishi [2 ]
机构：
[1] Shimane Univ, Interdisciplinary Grad Sch Sci & Engn, Matsue, Shimane, Japan
[2] Shimane Univ, Interdisciplinary Fac Sci & Engn, Matsue, Shimane, Japan
来源：
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS | 2013年 / 80卷
关键词：
Optimality conditions; DC programming; Reverse convex constraints; Convex programming; Fractional programming; OPTIMIZATION PROBLEMS;
D O I：
10.1016/j.na.2012.11.025
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we give necessary and sufficient optimality conditions for DC programming problems with reverse convex constraints defined by a finite family of pseudoconvex functions. As application, we obtain necessary and sufficient optimality conditions for DC programming problems and fractional programming problems. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码：18 / 27
页数：10
相关论文
共 50 条
12345