Optimality and duality for the multiobjective fractional programming with the generalized (F, ρ) convexity

A class of multiobjective fractional programmings (MFP) are first formulated, where the involved functions are local Lipschitz and Clarke subdifferentiable. In order to deduce our main results, we give the definitions of the generalized (F, ρ) convex class about the Clarke subgradient. Under the above generalized convexity assumption, the alternative theorem is obtained, and some sufficient and necessary conditions for optimality are also given related to the properly efficient solution for the problems. Finally, we formulate the two dual problems (MD) and (MD1) corresponding to (MFP), and discuss the week, strong and reverse duality.  2002 Elsevier Science (USA). All rights reserved.