Dimension and finite reduction in linear semi-infinite programming

DOI10.1080/02331939208843816MaRDI QIDQ4327939zbMATH OpenOpenAlexFDO

Authors Marco Antonio López Cerdá, 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 theoryFarkas-Minkowski systemsfinite reductionlinear inequality systemslinear semi-infinite programming

Mathematics Subject Classification ID

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

Recommendations

• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
• Facial reduction in partially finite convex programming
• Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
• Analytical linear inequality systems and optimization

Cites work

• A theory of linear inequality systems
• Algebraic theory of linear inequalities
• An Infinite Linear Program with a Duality Gap
• Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
• Convex Analysis
• Duality in semi-infinite programs and some works of Haar and Carathéodory
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Farkas-Minkowski systems in semi-infinite programming
• Global unicity in semi-infinite optimization
• scientific article; zbMATH DE number 4029251 (Why is no real title available?)
• scientific article; zbMATH DE number 3755766 (Why is no real title available?)
• scientific article; zbMATH DE number 3791103 (Why is no real title available?)
• scientific article; zbMATH DE number 3446685 (Why is no real title available?)
• On constraint sets of infinite linear programs over ordered fields
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming

Cited in

(4)

• Affine reductions for LPs and SDPs
• Finite-dimensional reductions of smooth extremal problems
• Some results about the facial geometry of convex semi-infinite systems
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming

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

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