Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity

被引：0
|
作者：
Altannar Chinchuluun
Dehui Yuan
Panos M. Pardalos
机构：
[1] University of Florida,Dept. of Industrial and Systems Engineering
[2] Hanshan Teachers’ College,Dept. of Mathematics and Computer Science
来源：
Annals of Operations Research | 2007年 / 154卷
关键词：
Multiobjective fractional programming problem; (; ,; ,; ,; )-convexity; Efficiency conditions; Global efficient solution; Duality;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we consider nondifferentiable multiobjective fractional programming problems. A concept of generalized convexity, which is called (C,α,ρ,d)-convexity, is first discussed. Based on this generalized convexity, we obtain efficiency conditions for multiobjective fractional programming (MFP). Furthermore, we establish duality results for three types of dual problems of (MFP) and present the corresponding duality theorems.
引用
收藏
页码：133 / 147
页数：14
相关论文
共 50 条
12345