Duality for Multiobjective B-vex Programming Involving n-Set Functions

In the present paper we consider a class of multiobjective B-vex programming problems involving differentiable B-vex n-set functions and establish duality results in terms of properly efficient solutions. Further, we relate the problem to a certain saddle point of a Lagrangian and show multiobjective fractional program as a special case of the main problem