A note on optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem

Abstract

Necessary optimality conditions for a vectorial bilevel programming problem are given by Dempe et al. [Optimization 69, 1811–1830, 2020]. The main result, Theorem 1, is based on a result of Dutta and Chandra [J. Optim. Theory Appl. 113, 41–64, 2002] which turned out to be incorrect. In this work, we propose an improvement to Dempe et al.'s result that does not use any convexity-type restriction.