On linear inequality systems with smooth coefficients

DOI10.1007/S10957-004-0941-1MaRDI QIDQ1777594zbMATH OpenOpenAlexFDO

Authors Miguel Angel Goberna, L. A. Hernández, 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 inequality systemslinear semi-infinite programmingclosed convex sets

Mathematics Subject Classification ID

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

Recommendations

• Separating the solution sets of analytical and polynomial systems
• A theory of linear inequality systems
• Stability Theory for Linear Inequality Systems
• Analytical linear inequality systems and optimization
• Publication:3469224

Cites work

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

Cited in

(5)

• Separating the solution sets of analytical and polynomial systems
• Representability of convex sets by analytical linear inequality systems.
• On \(C^m\) solutions to systems of linear inequalities
• scientific article; zbMATH DE number 4136128 (Why is no real title available?)
• Relaxation methods for solving linear inequality systems: converging results

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

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