Analytical linear inequality systems and optimization

DOI10.1023/A:1021773300365zbMath0961.90119OpenAlexW87171629MaRDI QIDQ1969463

Valentín Jornet, Maxim Ivanov Todorov, Miguel Angel Goberna, Rubén Puente

Publication date: 16 March 2000

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

Full work available at URL: https://doi.org/10.1023/a:1021773300365

zbMATH Keywords

semi-infinite programmingfeasible setgeometrical propertiespurification schemeanalytical constraint

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items (7)

Separating the solution sets of analytical and polynomial systems ⋮ Miguel A. Goberna: ``The challenge was to bring Spanish research in mathematics to normality ⋮ Representability of convex sets by analytical linear inequality systems. ⋮ Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming ⋮ On linear inequality systems with smooth coefficients ⋮ Selected applications of linear semi-infinite systems theory ⋮ Linear semi-infinite programming theory: an updated survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasipolyhedral sets in linear semiinfinite inequality systems
• A theory of linear inequality systems
• A purification algorithm for semi-infinite programming
• New descent rules for solving the linear semi-infinite programming problem
• Locally polyhedral linear inequality systems
• An extension of the simplex algorithm for semi-infinite linear programming
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• An optimality test for semi-infinite linear programming
• Optimality theory for semi-infinite linear programming^∗
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• Convex Analysis

This page was built for publication: Analytical linear inequality systems and optimization