Abstract
This paper aims at studying a broad class of mathematical programming with non-differentiable vanishing constraints. First, we are interested in some various qualification conditions for the problem. Then, these constraint qualifications are applied to obtain, under different conditions, several stationary conditions of type Karush/Kuhn–Tucker.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
