On constraint sets of infinite linear programs over ordered fields

DOI10.1007/BF01582242zbMath0588.90055OpenAlexW2067134453MaRDI QIDQ3716808

No author found.

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582242

zbMATH Keywords

extreme pointsordered fieldsinfinite system of linear equationsdirections of subsetsopposite sign propertysemi-infinite or fully infinite programs

Mathematics Subject Classification ID

Linear programming (90C05) Programming in abstract spaces (90C48) Semi-infinite programming (90C34)

Related Items (8)

Boundedness relations in linear semi-infinite programming ⋮ Geometric fundamentals of the simplex method in semi-infinite programming ⋮ Dimension and finite reduction in linear semi-infinite programming ⋮ An optimality test for semi-infinite linear programming ⋮ Caracterizacion algebraica de las aristas infinitas en el conjunto dual factible de un psi-lineal ⋮ The capacity problem ⋮ On Haar's dual problem ⋮ Linear semi-infinite programming theory: an updated survey

Cites Work

• Unnamed Item
• Lexocographic multipliers
• An extension of a theorem of Jeroslow and Kortanek
• On semi-infinite systems of linear inequalities
• Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
• On extreme points of bounded sets of generalized finite sequence spaces
• The extreme point characterization of semi-infinite dual non-Archimedean balls
• Complexity and computability of solutions to linear programming systems

This page was built for publication: On constraint sets of infinite linear programs over ordered fields