Abstract: B-(p,r)-invexity is a new generalized invex function. By using B-(p,r)-invexity functions, the wolfe dual of the multiobjective programming problems is considered, in which the objective and the constraint functions are differentiable. The weak, strong and strict converse duality results are established, these results are obtained under B-(p,r)-invexity assumptions on objective and the constraint functions. The work generalizes many results on programming problems with B-invexity functions, (p,r)-invexity functions and invex functions.