Duality Results in terms of Convexifactors for a Bilevel Multiobjective Optimization Problem

Abstract

In this work, we have formulated a Wolfe type dual for a multiobjective bilevel programming problem, which involves vector-valued objective function in the upper level and single objective function in the lower level. Under generalized convexity assumptions, on the functions involved weak and strong duality theorems are derived. Some examples are given to illustrate the applicability of the obtained results.