Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints

We consider nonsmooth multiobjective fractional programming problems with inequality and equality constraints. We establish the necessary and sufficient optimality conditions under various generalized invexity assumptions. In addition, we formulate a mixed dual problem corresponding to primal problem, and discuss weak, strong and strict converse duality theorems. Keywords Multiobjective fractional problems

• Type: Journal
• Year: 2008
• Where: JGO
• Authors: S. Nobakhtian
• Keywords: Converse Duality Theorems, JGO 2008, Multiobjective Fractional Problems, Multiobjective Fractional Programming