Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions

Abstract

We establish the Kuhn–Tucker necessary and sufficient conditions for an efficient optimum of nonsmooth multiobjective fractional programming problems containing pseudo–invex functions. Bector type dual for multiobjective fractional programming problem is introduced and certain duality results have been derived in the framework of pseudo–invex functions