Theorems on the dimensions of convex sets

DOI10.1016/0024-3795(75)90127-5zbMath0317.52004OpenAlexW1980355224MaRDI QIDQ1221941

Ulrich Eckhardt

Publication date: 1975

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(75)90127-5

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

A common formula to compute the efficient sets of a class of multiple objective linear programming problems ⋮ Boundedness relations in linear semi-infinite programming ⋮ A theory of linear inequality systems ⋮ Voronoi cells via linear inequality systems ⋮ Clark's theorem for semi-infinite convex programs ⋮ A primal-dual algorithm for the fermat-weber problem involving mixed gauges ⋮ A finite cutting plane method for solving linear programs with an additional reverse convex constraint ⋮ Minimal representation of convex polyhedral sets ⋮ A finite algorithm for solving the generalized lattice point problem ⋮ Description of the optimal solution set of the linear programming problem and the dimension formula ⋮ On a classification scheme for geometric programming and complementarity theorems†^† ⋮ Selected applications of linear semi-infinite systems theory ⋮ Duality gaps in semi-infinite linear programming—an approximation problem ⋮ Limiting Lagrangians: A primal approach ⋮ A note about linear inequality systems and duality ⋮ A primal-dual projection method for solving systems of linear inequalities ⋮ Complete controllability

Cites Work

• Boundedness relations for linear constraint sets
• On semi-infinite systems of linear inequalities
• Transformations by diagonal matrices in a normed space
• Remark on the Constraint Sets in Linear Programming
• On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
• Complementarity Theorems for Linear Programming
• Bestimmung der dimension eines polyeders mit hilfe der simplexmethode
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item