Unique representation in convex sets by extraction of marked components
From MaRDI portal
Publication:1837113
DOI10.1016/0024-3795(83)90150-7zbMath0506.90068MaRDI QIDQ1837113
Ulrich Krause, Diederich Hinrichsen
Publication date: 1983
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(83)90150-7
convex sets; convex cone; convex analysis; face lattice; parametric linear programs; extraction of marked components; marked representation theorem; polyhedral triangulation
90C25: Convex programming
90C31: Sensitivity, stability, parametric optimization
90C05: Linear programming
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
52Bxx: Polytopes and polyhedra
Related Items
Cites Work
- A triangulation of the n-cube
- Lifting projections of convex polyhedra
- Ordered linear spaces
- Finding simplicial subdivisions of polytopes
- Two Algorithms for Determining Volumes of Convex Polyhedra
- Extreme points of convex sets without completeness of the Scalar field
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item