In this paper, the concept of proper eciency has been incorporated to develop the
optimality conditions and duality results for dierentiable nonconvex multiobjective
programming problems. The assumptions on properly eciency are relaxed by means
of the introduced classes of vector-valued B-(p; r)-invex functions. These results ex-
tend several known results to a wider class of nonconvex vector optimization problems.
Keywords: multiobjective programming, properly e cient solution, (strictly) B-
(p; r)-invex function with respect to and b, optimality conditions, duality.
