Please use this identifier to cite or link to this item:
Title: Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
Author: Kostyukova, O. I.
Tchemisova, T. V.
Keywords: Semi-infinite programming (SIP)
Constraint qualifications (CQ)
Lower Level Problem-Immobile index
Immobility order
Optimality conditions
Nonlinear Programming (NLP)
Issue Date: 19-Feb-2015
Publisher: Springer Verlag
Abstract: In the paper, we consider a problem of convex Semi-Infinite Programming with a compact index set defined by a finite number of nonlinear inequalities. While studying this problem, we apply the approach developed in our previous works and based on the notions of immobile indices, the corresponding immobility orders and the properties of a specially constructed auxiliary nonlinear problem. The main results of the paper consist in the formulation of sufficient optimality conditions for a feasible solution of the original SIP problem in terms of the optimality conditions for this solution in a specially constructed auxiliary nonlinear programming problem and in study of certain useful properties of this finite problem.
Peer review: yes
DOI: 10.1007/s11228-015-0320-0
ISSN: 1877-0533
Appears in Collections:CIDMA - Artigos
OGTCG - Artigos

Files in This Item:
File Description SizeFormat 
Set-Valued-KT-2015.pdf470.22 kBAdobe PDFrestrictedAccess
Set-Values-RIA.pdf197.81 kBAdobe PDFView/Open

Formato BibTex MendeleyEndnote Degois 

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