Unique representation in convex sets by extraction of marked components

DOI10.1016/0024-3795(83)90150-7zbMath0506.90068OpenAlexW2075760542MaRDI QIDQ1837113

Diederich Hinrichsen, Ulrich Krause

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

zbMATH Keywords

convex setsconvex coneconvex analysisface latticeparametric linear programsextraction of marked componentsmarked representation theorempolyhedral triangulation

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Polytopes and polyhedra (52Bxx)

Related Items (1)

A general theory of almost factoriality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Unique representation in convex sets by extraction of marked components