Farkas-type results for constrained fractional programming with DC functions

作     者：Sun, Xiang-Kai Chai, Yi Zeng, Jing 

作者机构：Chongqing Technol & Business Univ Coll Math & Stat Chongqing 400067 Peoples R China Chongqing Univ Coll Automat Chongqing 400044 Peoples R China Chongqing Univ State Key Lab Power Transmiss Equipment & Syst Se Coll Automat Chongqing 400044 Peoples R China 

出 版 物：《OPTIMIZATION LETTERS》 (最优化通信)

年 卷 期：2014年第8卷第8期

页      面：2299-2313页

核心收录：

学科分类：0810[工学-信息与通信工程] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 08[工学] 070104[理学-应用数学] 081001[工学-通信与信息系统] 0701[理学-数学] 

基　　金：National Natural Science Foundation of China [11301570, 61374135] Basic and Advanced Research Project of CQ CSTC [cstc2013jcyjA00003] China Postdoctoral Science Foundation [2013M540697] Chongqing Technology and Business University [2013-56-03] Natural Science Foundation Project of CQ CSTC [cstc2012jjA00038] 

主　　题：Closedness conditions Farkas-type results Fractional programming DC functions 

摘      要：In this paper, by using the properties of the epigraph of the conjugate functions, we introduce some closedness conditions and investigate some characterizations of these closedness conditions. Then, by using these closedness conditions, we obtain some Farkas-type results for a constrained fractional programming problem with DC functions. We also show that our results encompass as special cases some programming problems considered in the recent literature.