Please use this identifier to cite or link to this item:
Title: Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices
Author: Kostyukova, O. I.
Tchemisova, T. V.
Yermalinskaya, S. A.
Keywords: Convex semi-infinite programming
Nonlinear programming
Optimality criteria
Constraint qualifications
Issue Date: 2010
Publisher: Springer Verlag
Abstract: We state a new implicit optimality criterion for convex semi-infinite programming (SIP) problems. This criterion does not require any constraint qualification and is based on concepts of immobile index and immobility order. Given a convex SIP problem with a continuum of constraints, we use an information about its immobile indices to construct a nonlinear programming (NLP) problem of a special form. We prove that a feasible point of the original infinite SIP problem is optimal if and only if it is optimal in the corresponding finite NLP problem. This fact allows us to obtain new efficient optimality conditions for convex SIP problems using known results of the optimality theory of NLP. To construct the NLP problem, we use the DIO algorithm. A comparison of the optimality conditions obtained in the paper with known results is provided.
Peer review: yes
DOI: 10.1007/s10957-009-9621-5
ISSN: 0022-3239
Appears in Collections:CIDMA - Artigos

Files in This Item:
File Description SizeFormat 
JOTA-2010.pdf400.05 kBAdobe PDFrestrictedAccess

Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.