Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets

• Autor(a) principal: Kostyukova, O.
• Data de Publicação: 2017
• Outros Autores: Tchemisova, Tatiana
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10773/18249
• topic: Convex Programming; Semi-Infinite Programming (SIP); Nonlinear Programming (NLP); Convex set; Finitely representable set; Constraint Qualifications (CQ); Immobile index; Optimality condition

In the present paper, we analyze a class of convex Semi-Infinite Programming problems with arbitrary index sets defined by a finite number of nonlinear inequalities. The analysis is carried out by employing the constructive approach, which, in turn, relies on the notions of immobile indices and their immobility orders. Our previous work showcasing this approach includes a number of papers dealing with simpler cases of semi-infinite problems than the ones under consideration here. Key findings of the paper include the formulation and the proof of implicit and explicit optimality conditions under assumptions, which are less restrictive than the constraint qualifications traditionally used. In this perspective, the optimality conditions in question are also compared to those provided in the relevant literature. Finally, the way to formulate the obtained optimality conditions is demonstrated by applying the results of the paper to some special cases of the convex semi-infinite problems