No abstract

No abstract

The main aim of this paper is to develop necessary Optimality conditions using Convexifactors for mathematical programs with equilibrium constraints (MPEC). For this purpose a nonsmooth version of the standard Guignard constraint qualification (GCQ) and strong stationarity are introduced in terms of convexifactors for MPEC. It is shown that Strong stationarity is the first order necessary optimality condition under nonsmooth version of the standard GCQ. Finally, notions of asymptotic pseudoconvexity and asymptotic quasiconvexity are used to establish the sufficient optimality conditions for MPEC.

No abstract

<p style='text-indent:20px;'>The main aim of this paper is to establish sufficient optimality conditions using an upper estimate of Clarke subdifferential of value function and the concept of convexifactor for optimistic bilevel programming problems with convex and non-convex lower-level problems. For this purpose, the notions of asymptotic pseudoconvexity and asymptotic quasiconvexity are defined in terms of the convexifactors.</p>