ABSTRACT In this paper, we are concerned with a multiobjective bilevel optimization problem , where the lower-level problem is also a multiobjective optimization problem. Using the optimal-value reformulation, together with a scalarization technique, under a nonsmooth generalized Guignard constraint qualification, one gives necessary optimality conditions for the initial problem. As an application, one deduces optimality conditions for a scalar bilevel programming problem in terms of convexificators. An example is given to illustrate our findings.

中文翻译：

---

双层多目标优化问题的凸化器的最优条件

摘要 在本文中，我们关注的是一个多目标双层优化问题，其中低层问题也是一个多目标优化问题。使用最优值重构，连同标量化技术，在非光滑广义 Guignard 约束条件下，可以给出初始问题的必要最优条件。作为一种应用，可以根据凸化器推导出标量双层规划问题的最优条件。给出了一个例子来说明我们的发现。