Separating the solution sets of analytical and polynomial systems

DOI10.1007/BF02579058zbMATH Open1112.90086OpenAlexW2077978657MaRDI QIDQ819953FDOQ819953

Authors: Miguel Angel Goberna, L. A. 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

Recommendations

• On linear inequality systems with smooth coefficients
• On linear systems containing strict inequalities
• Analytical linear inequality systems and optimization
• Publication:3469224
• A theory of linear inequality systems

zbMATH Keywords

linear systemsconvex setsLinear semi-infinite programming

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Semi-infinite programming (90C34) Linear inequalities of matrices (15A39)

Cites Work

• Title not available (Why is that?)
• An extension of the simplex algorithm for semi-infinite linear programming
• On the stability of the boundary of the feasible set in linear optimization
• Analytical linear inequality systems and optimization
• Representability of convex sets by analytical linear inequality systems.
• On linear inequality systems with smooth coefficients

Cited In (5)

• Representability of convex sets by analytical linear inequality systems.
• On linear inequality systems with smooth coefficients
• Selected applications of linear semi-infinite systems theory
• Relaxation methods for solving linear inequality systems: converging results
• Separation bounds for polynomial systems

This page was built for publication: Separating the solution sets of analytical and polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q819953)