Volume 5, Number 3, September 2009, pp. 403-413

Ying Gao and Weidong Rong
Key words:
multiobjective generalized fractional programming, optimality conditions, duality theorems, constraint qualification, generalized convexity
Mathematices Subject Classification: 90C32, 90C46, 90C47
ONLINE SUBSCRIPTION (Institutional Subscription Only)
Copyright© 2009 Yokohama Publishers
Back

Abstract:
In this paper, we are concerned with a nondifferentiable multiobjective generalized fractional programming problem. We present the Kuhn-Tucker type necessary condition for a weakly efficient solution, under the assumption of a kind of generalized Abadie Constraint Qualification. And then the Kuhn-Tucker type sufficient condition for weakly efficient solution is given under the assumption of (C, α, ρ, d)-convexity. Subsequently, we apply the optimality conditions to formulate a kind of duality model and prove some duality theorems.
Optimality conditions and duality in multiobjective generalized fractional programming with generalized convexity