Distance to Solvability/Unsolvability in Linear Optimization

DOI10.1137/040612981zbMath1097.65066OpenAlexW2052497053MaRDI QIDQ5470213

Marco A. López, Maria J. Cánovas, F. Javier Toledo, Juan Parra

Publication date: 30 May 2006

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/75172

zbMATH Keywords

stabilitynumerical examplesperturbationssolvabilityill-posed problemslinear optimizationill-posedness

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39) Semi-infinite programming (90C34) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items (13)

LP relaxations for a class of linear semi-infinite programming problems ⋮ Distance to ill-posedness in linear optimization via the Fenchel-Legendre conjugate ⋮ Sufficient conditions for total ill-posedness in linear semi-infinite optimization ⋮ Recent contributions to linear semi-infinite optimization ⋮ Generic primal-dual solvability in continuous linear semi-infinite programming ⋮ Marco A. López, a pioneer of continuous optimization in Spain ⋮ Stability in linear optimization and related topics. A personal tour ⋮ Characterization of total ill-posedness in linear semi-infinite optimization ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Primal-dual stability in continuous linear optimization ⋮ Stability and Continuity in Robust Optimization ⋮ Error bounds for the inverse feasible set mapping in linear semi-infinite optimization via a sensitivity dual approach ⋮ Primal, dual and primal-dual partitions in continuous linear optimization

This page was built for publication: Distance to Solvability/Unsolvability in Linear Optimization