One-parameter families of feasible sets in semi-infinite optimization

DOI10.1023/A:1008282216306zbMath0933.90062OpenAlexW199323270MaRDI QIDQ1292198

Jan-Joachim Rückmann, Hubertus Th. Jongen

Publication date: 2 April 2000

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008282216306

zbMATH Keywords

bifurcation pointconstraint qualificationfeasible setsemi-infinite optimization

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Semi-infinite programming (90C34)

Related Items (6)

On the equivalence of parametric contexts for linear inequality systems ⋮ On the closure of the feasible set in generalized semi-infinite programming ⋮ Generalized semi-infinite programming: On generic local minimizers ⋮ On topological properties of min-max functions ⋮ First-order optimality conditions in generalized semi-infinite programming ⋮ Linear semi-infinite programming theory: an updated survey

This page was built for publication: One-parameter families of feasible sets in semi-infinite optimization