Efficiency conditions and duality for a class of multiobjective fractional programming problems

被引:81
|
作者
Liang, ZA [1 ]
Huang, HX
Pardalos, PM
机构
[1] Shanghai Univ Finance & Econ, Dept Appl Math, Shanghai 200433, Peoples R China
[2] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China
[3] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL 32611 USA
关键词
duality; efficiency condition; efficient solution; (F; alpha; p; d)-convex functions; multiobjective fractional programming problem;
D O I
10.1023/A:1026041403408
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A class of constrained multiobjective fractional programming problems is considered from a viewpoint of the generalized convexity. Some basic concepts about the generalized convexity of functions, including a unified formulation of generalized convexity, are presented. Based upon the concept of the generalized convexity, efficiency conditions and duality for a class of multiobjective fractional programming problems are obtained. For three types of duals of the multiobjective fractional programming problem, the corresponding duality theorems are also established.
引用
收藏
页码:447 / 471
页数:25
相关论文
共 50 条