On constraint sets of infinite linear programs over ordered fields

DOI10.1007/BF01582242zbMath0588.90055MaRDI QIDQ3716808

No author found.

Publication date: 1985

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

zbMATH Keywords

extreme points; ordered fields; infinite system of linear equations; directions of subsets; opposite sign property; semi-infinite or fully infinite programs

Mathematics Subject Classification ID

90C05: Linear programming

90C48: Programming in abstract spaces

90C34: Semi-infinite programming

Related Items

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

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