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

被引：48

作者：

Chinchuluun, Altannar

Yuan, Dehui

Pardalos, Panos M.

机构：

[1] Univ Florida, Dept Ind & Syst Engn, Gainesville, FL 32611 USA

[2] Hanshan Teachers Coll, Dept Math & Comp Sci, Chaozhou, Guangdong, Peoples R China

来源：

ANNALS OF OPERATIONS RESEARCH | 2007年 / 154卷 / 01期

基金：

美国国家科学基金会;

关键词：

multiobjective fractional programming problem; (C; alpha; rho; d)-convexity; efficiency conditions; global efficient solution; duality;

D O I：

10.1007/s10479-007-0180-6

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we consider nondifferentiable multiobjective fractional programming problems. A concept of generalized convexity, which is called (C, alpha, rho, 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

页数：15

共 24 条

[1] Generalized invexity and duality in multiobjective programming problems [J].