Duality and Farkas-type results for DC fractional programming with DC constraints

Duality and Farkas-type results for DC fractional programming with DC constraints
复制标题

DOI：
10.1016/j.mcm.2010.11.059
复制
发表时间：
2011-03
期刊：
Math. Comput. Model.
影响因子：
--
通讯作者：
Haijun Wang;Cao-zong Cheng
Haijun Wang;Cao-zong Cheng
中科院分区：
其他
文献类型：
--
作者：
Haijun Wang;Cao-zong Cheng

文献摘要

被引文献

相似文献

本文的目的是讨论目标函数是具有有限个DC约束的两个DC(凸差)函数之比的分式规划问题(P)。构造了一类对偶问题，得到了对偶断言。利用所得到的对偶断言，给出了刻画问题(P)最优值的几个Farkas型结果。最近文献中考虑的一些规划问题是问题(P)的特例。
The aim of this paper is to discuss the fractional programming problem (P) that an objective function is a ratio of two DC (difference of convex) functions with finitely many DC constraints. A type of dual problem is constructed and the duality assertions are obtained. By using the obtained duality assertions, some Farkas-type results which characterize the optimal value of the problem (P) are given. Some programming problems considered in recent literature are the special cases of the problem (P).