|
Article information
1999 , Volume 4, ¹ 3, p.41-61
Weber G.W.
Generalized semi-infinite optimization: on some foundations
In this paper we study semi-infinite optimization problems of the generalized form:  and where  are feasible sets in the sense of finitely constrained optimization. We assume that some constraint qualification (LICQ or MFCQ) holds for Y(x) locally (or globally) in x. Then, we can locally (or globally) represent  as an ordinary semi-infinite optimization problem. Hereby, we use two different approaches, each of them with or without a compactness assumption on Y(x). Moreover, for we present first order necessary or, under appropriate further assumptions, sufficient optimality conditions which were, for a special case, firstly given by Kaiser and Krabs.
[full text] Classificator Msc2000:- *65K05 Mathematical programming
- 90C31 Sensitivity, stability, parametric optimization
- 90C34 Semi-infinite programming
- 90C46 Optimality conditions, duality
Classificator Computer Science:- *G.1.6 Optimization
Keywords: Generalized semi-infinite optimization,ordinary semi-infinite optimization,first order optimality conditions,linear independence constraint qualification,Mangasarian-Fromovitz constraint qualification,local-global analysis, semi-infinite optimization, optimality condition
Author(s):
Weber GerhardW.
Office: Institute of Applied Mathematics, METU
Address: 64289, Turkey, Ankara
E-mail: gweber@metu.edu.tr
Bibliography link:
Weber G.W. Generalized semi-infinite optimization: on some foundations // Computational technologies. 1999. V. 4. ¹ 3. P. 41-61
|
