Higher-order symmetric duality for a class of multiobjective fractional programming problems

被引：8
|
作者：
Ying, Gao [1 ]
机构：
[1] Chongqing Normal Univ, Dept Math, Chongqing 400047, Peoples R China
来源：
JOURNAL OF INEQUALITIES AND APPLICATIONS | 2012年
基金：
美国国家科学基金会;
关键词：
Higher-order symmetric duality; multiobjective fractional programming; higher-order; (F; alpha; rho; d)-convexity; GENERALIZED INVEXITY; F-CONVEXITY; 2ND-ORDER;
D O I：
10.1186/1029-242X-2012-142
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, a pair of nondifferentiable multiobjective fractional programming problems is formulated. For a differentiable function, we introduce the definition of higher-order (F, alpha, rho, d)-convexity, which extends some kinds of generalized convexity, such as second order F-convexity and higher-order F -convexity. Under the higher-order (F, alpha, rho, d)-convexity assumptions, we prove the higher-order weak, higher-order strong and higher-order converse duality theorems. Mathematics Subject Classification (2010) 90C29; 90C30; 90C46.
引用
收藏
页数：12
相关论文
共 50 条
12345