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

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 thei...

Full description

Bibliographic Details
Main Author: Kostyukova, O. (author)
Other Authors: Tchemisova, Tatiana (author)
Format: article
Language:eng
Published: 2017
Subjects:
Convex Programming
Semi-Infinite Programming (SIP)
Nonlinear Programming (NLP)
Convex set
Finitely representable set
Constraint Qualifications (CQ)
Immobile index
Optimality condition
Online Access:http://hdl.handle.net/10773/18249
Country:Portugal
Oai:oai:ria.ua.pt:10773/18249

Internet

http://hdl.handle.net/10773/18249

Similar Items