Optimality Conditions for Optimistic Bilevel Programming Problem Using Convexifactors

In this article, we introduce two versions of nonsmooth extension of Abadie constraint qualification in terms of convexifactors and Clarke subdifferential and employ the weaker one to develop new necessary Karush–Kuhn–Tucker type optimality conditions for optimistic bilevel programming problem with convex lower‐level problem, using an upper estimate of Clarke subdifferential of value function in variational analysis and the concept of convexifactor.