Abstract
In this paper, we consider semi-infinite mathematical programming problems withequilibrium constraints (SIMPEC). By using the notion of convexificators, we establish sufficient optimality conditions for the SIMPEC. We formulate Wolfe and Mond-Weir type dual models for the SIMPEC under generalized convexity assumptions. Moreover, weak and strong duality theorems are established to relate the SIMPEC and two dual programs in the framework of convexificators.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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: Statistics, Optimization & Information Computing
Paper Title
Journal
Date
