On nonsmooth mathematical programs with equilibrium constraints using generalized convexity
DOI:
https://doi.org/10.2298/YJOR180915008JKeywords:
duality, stationary point, generalized invexity, convexificatorsAbstract
In this paper, we derive the sufficient condition for global optimality for a nonsmooth mathematical program with equilibrium constraints involving generalized invexity. We formulate the Wolfe and Mond-Weir type dual models for the problem using convexificators. We establish weak and strong duality theorems to relate the mathematical program with equilibrium constraints and the dual models in the framework of convexificators.Downloads
Published
2019-11-01
Issue
Section
Research Articles
License
Copyright (c) 2019 YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.