Optimality conditions and duality for a class of nondifferentiable multi-objective fractional programming problems

Abstract

Issue Title: Multilevel Optimization: Algorithms and Applications

A class of multi-objective fractional programming problems (MFP) are considered where the involved functions are locally Lipschitz. In order to deduce our main results, we give the definition of the generalized (F,θ,ρ,d)-convex class about the Clarke's generalized gradient. Under the above generalized convexity assumption, necessary and sufficient conditions for optimality are given. Finally, a dual problem corresponding to (MFP) is formulated, appropriate dual theorems are proved. [PUBLICATION ABSTRACT]