Sufficiency and duality for mathematical programming problems with equilibrium constraints, involving generalized convex functions

Abstract

In this paper, we show that M-stationary condition is sufficient for global or local optimality under some mathematical programming problem with equilibrium constraints(MPECs) and generalized invexity assumptions. Further, we formulate and study, Wolfe type and Mond-Weir type dual models for the MPEC and we establish weak and strong duality theorems relating to the MPEC and the two dual models under invexity and generalized invexity as-sumptions.