Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets

In the present paper, we analyze a class of convex semi-infinite programming problems with arbitrary index sets defined by a finite number of nonlinear inequalities. The analysis is carried out by employing the constructive approach, which, in turn, relies on the notions of immobile indices and thei...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of optimization theory and applications Vol. 175; no. 1; pp. 76 - 103
Main Authors:	Kostyukova, Olga, Tchemisova, Tatiana
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2017 Springer Nature B.V
Subjects:	Applications of Mathematics Calculus of Variations and Optimal Control; Optimization Economic models Engineering Inequalities Mathematics Mathematics and Statistics Nonlinear analysis Nonlinear programming Operations Research/Decision Theory Optimization Proving Theory of Computation Optimality conditions Convex set 90C30 90C25 Immobile index 90C34 Finitely representable set Constraint qualifications (CQ) Convex programming Nonlinear programming (NLP) Semi-infinite programming (SIP)
ISSN:	0022-3239, 1573-2878
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!