Abstract
In this paper, we consider semi-infinite mathematical programming problems with equilibrium constraints (SIMPPEC). By using the notion of convexificators, we establish sufficient optimality conditions for the SIMPPEC. We formulate Wolfe and Mond–Weir-type dual models for the SIMPPEC under the invexity and generalized invexity assumptions. Weak and strong duality theorems are established to relate the SIMPPEC and two dual programs in the framework of convexificators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Operations Research Society of China
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
