Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems  

作　　者：GAO Ying RONG Wei-dong 

机构地区：[1]School of Mathematical Sciences, Inner Mongolia University, Hohhot 010021, China

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》2008年第3期331-344,共14页高校应用数学学报（英文版）（B辑）

基　　金：Supported by Chongqing Key Lab. of Operations Research and System Engineering

摘　　要：This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of （F, α, ρ, d）-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.

关 键 词：operations research multiobjective generalized fractional programming optimality condition duality theorem generalized convexity 

分 类 号：O174.13[理学—数学]