Convex SIP Problems with Finitely Representable Compact Index Sets: Immobile Indices and the Properties of the Auxiliary NLP Problem
- 77 Downloads
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.
KeywordsSemi-infinite programming (SIP) Constraint qualifications (CQ) Lower level problem (SIP) Immobile index Immobility order Optimality conditions Nonlinear programming (NLP)
Mathematics Subject Classification (2010)90C25 90C30 90C34
Unable to display preview. Download preview PDF.
- 8.Goberna, M.A., López, M.A. (eds.): Semi-Infinite Programming: Recent Advances. Kluwer, Dordrecht (2001)Google Scholar
- 18.Kostyukova, O.I., Tchemisova, T.V.: A constructive algorithm for determination of immobile indices in convex SIP problems with polyhedral index sets, Working paper, University of Aveiro (2012). http://hdl.handle.net/10773/8888