Abstract
We examine the topological structure of the upper-level set Mmax given by a min-max function φ. It is motivated by recent progress in Generalized Semi-Infinite Programming (GSIP). Generically, Mmax is proven to be the topological closure of the GSIP feasible set (see Guerra-Vazquez et al. 2009; Gunzel et al., Cent Eur J Oper Res 15(3):271–280, 2007). We formulate two assumptions (Compactness Condition CC and Sym-MFCQ) which imply that Mmax is a Lipschitz manifold (with boundary). The Compactness Condition is shown to be stable under C0-perturbations of the defining functions of φ. Sym-MFCQ can be seen as a constraint qualification in terms of Clarke’s subdifferential of the min-max function φ. Moreover, Sym-MFCQ is proven to be generic and stable under C1-perturbations of the defining functions which fulfill the Compactness Condition. Finally we apply our results to GSIP and conclude that generically the closure of the GSIP feasible set is a Lipschitz manifold (with boundary).
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.
