Dimension and finite reduction in linear semi-infinite programming

DOI10.1080/02331939208843816zbMath0817.90125OpenAlexW2020204828MaRDI QIDQ4327939

Marco A. López, Miguel Angel Goberna

Publication date: 1 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843816

zbMATH Keywords

duality theorylinear semi-infinite programminglinear inequality systemsFarkas-Minkowski systemsfinite reduction

Mathematics Subject Classification ID

Linear programming (90C05) Linear inequalities of matrices (15A39) Semi-infinite programming (90C34) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Related Items

Some results about the facial geometry of convex semi-infinite systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of linear inequality systems
• Farkas-Minkowski systems in semi-infinite programming
• Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Global unicity in semi-infinite optimization
• On constraint sets of infinite linear programs over ordered fields
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• An Infinite Linear Program with a Duality Gap
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• Algebraic theory of linear inequalities
• Convex Analysis

This page was built for publication: Dimension and finite reduction in linear semi-infinite programming