On generalized strongly convex functions involving bifunctions

Abstract

This research article is based on generalized convex functions involving arbitrary bifunctions. We derive sufficient condition for global optimality for a nonsmooth mathematical program with equilibrium constraints involving generalized convexity assumptions. We formulate the Wolfe and Mond-Weir type dual models for the problem using convexificators. Further, we establish weak and strong duality theorems to relate the mathematical program with equilibrium constraints and the dual models in the framework of convexificators.