Global efficiency for multiobjective bilevel programming problems under generalized invexity

In this paper, we consider a nonlinear optimistic bilevel programming problem where the upper-level is a vector optimization problem and the lower-level is a scalar optimization problem. By using the Karush-Kuhn-Tucker conditions associated to the lower-level problem, we reformulate the bilevel programming problem into a nonlinear multiobjective single-level programming problem with equality and inequality constraints . Similarly to Dempe and Dutta (2012), we establish relationships between the problems and . We prove that under appropriate constraint qualification and convexity assumptions, global (weakly or properly) efficient solutions of correspond to global (weakly or properly) efficient solutions of . We establish Fritz John type necessary efficiency conditions for without using any constraint qualification. Furthermore, we obtain (Fritz John type) sufficient efficiency conditions for a feasible point of corresponds to a (weakly or properly) efficient solution for the bilevel problem under various forms of generalized invexity and infineness. Moreover, a linear multiobjective bilevel programming problem is studied and sufficient efficiency conditions are derived. To illustrate the obtained results some examples are given.