On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets

In the paper,we consider a problem of convex Semi-Infinite Programming with an infinite index set in the form of a convex polyhedron. In study of this problem, we apply the approach suggested in our recent paper [Kostyukova OI, Tchemisova TV. Sufficient optimality conditions for convex Semi Infinite...

Full description

Bibliographic Details
Main Author: Tchemisova, T. V. (author)
Other Authors: Olga, Kostyukova (author)
Format: article
Language:eng
Published: 1000
Subjects:
Semi-infinite programming (SIP)
Semidefinite programming (SDP)
Constraint qualification (CQ)
Immobile index
Immobility order
Optimality conditions
Online Access:http://hdl.handle.net/10773/21856
Country:Portugal
Oai:oai:ria.ua.pt:10773/21856

Internet

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

Similar Items