On linear inequality systems with smooth coefficients

DOI10.1007/s10957-004-0941-1zbMath1070.15012OpenAlexW1979390716MaRDI QIDQ1777594

Lidia Hernández, Miguel Angel Goberna, Maxim Ivanov Todorov

Publication date: 24 May 2005

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-004-0941-1

zbMATH Keywords

linear semi-infinite programminglinear inequality systemsclosed convex sets

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Semi-infinite programming (90C34)

Related Items (2)

Separating the solution sets of analytical and polynomial systems ⋮ Relaxation methods for solving linear inequality systems: converging results

Cites Work

• A purification algorithm for semi-infinite programming
• New descent rules for solving the linear semi-infinite programming problem
• Representability of convex sets by analytical linear inequality systems.
• Conjugacy for closed convex sets
• An extension of the simplex algorithm for semi-infinite linear programming
• Analytical linear inequality systems and optimization
• Optimality theory for semi-infinite linear programming^∗

This page was built for publication: On linear inequality systems with smooth coefficients