Algorithmic determination of immobile indices in convex SIP problems with polyhedral index sets

The concepts of immobile indices and their immobility orders are objective and important characteristics of feasible sets of semi-infinite programming (SIP) problems. They can be used for the formulation of new efficient optimality conditions without constraint qualifications. Given a class of conve...

Full description

Bibliographic Details
Main Author: Kostyukova, O. I. (author)
Other Authors: Tchemisova, T. V. (author)
Format: article
Language:eng
Published: 2019
Subjects:
Semi-infinite programming (SIP)
Convex programming (CP)
Immobile index
Immobility order
Cone of feasible directions
Extremal ray
Online Access:http://hdl.handle.net/10773/25231
Country:Portugal
Oai:oai:ria.ua.pt:10773/25231

Internet

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

Similar Items