Solving strategies and well-posedness in linear semi-infinite programming

DOI10.1023/A:1010920507183zbMath0997.90082OpenAlexW173225913MaRDI QIDQ5948176

Maxim Ivanov Todorov, Marco A. López, Maria J. Cánovas, Juan Parra

Publication date: 31 October 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

stabilityoptimal value functionsemi-infinite programmingfesible set mappingHadamard well posednessoptimal set mapping

Mathematics Subject Classification ID

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

Related Items (8)

Semi-infinite programming ⋮ Sufficient conditions for total ill-posedness in linear semi-infinite optimization ⋮ Regularity modulus of arbitrarily perturbed linear inequality systems ⋮ Characterization of total ill-posedness in linear semi-infinite optimization ⋮ Ill-posedness with respect to the solvability in linear optimization ⋮ Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems ⋮ On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems ⋮ Linear semi-infinite programming theory: an updated survey

This page was built for publication: Solving strategies and well-posedness in linear semi-infinite programming