A constructive algorithm for determination of immobile indices in convex SIP problems with polyhedral index sets

We consider convex Semi-Infinite Programming (SIP) problems with polyhedral index sets. For these problems, we generalize the concepts of immobile indices and their immobility orders (that are objective and important characteristics of the feasible sets permitting to formulate new efficient optimali...

Full description

Bibliographic Details
Main Author: Kostyukova, O. I. (author)
Other Authors: Tchemisova, T. V. (author)
Format: workingPaper
Language:eng
Published: 2012
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/8888
Country:Portugal
Oai:oai:ria.ua.pt:10773/8888

Internet

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

Similar Items