Separating the solution sets of analytical and polynomial systems
From MaRDI portal
Publication:819953
DOI10.1007/BF02579058zbMath1112.90086OpenAlexW2077978657MaRDI QIDQ819953
Miguel Angel Goberna, Lidia Hernández, Maxim Ivanov Todorov
Publication date: 4 April 2006
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579058
Linear inequalities of matrices (15A39) Semi-infinite programming (90C34) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (2)
Relaxation methods for solving linear inequality systems: converging results ⋮ Selected applications of linear semi-infinite systems theory
Cites Work
- Unnamed Item
- Representability of convex sets by analytical linear inequality systems.
- On linear inequality systems with smooth coefficients
- On the stability of the boundary of the feasible set in linear optimization
- An extension of the simplex algorithm for semi-infinite linear programming
- Analytical linear inequality systems and optimization
This page was built for publication: Separating the solution sets of analytical and polynomial systems
