The Minkowski theorem for max-plus convex sets

From MaRDI portal
Publication:869905

DOI10.1016/J.LAA.2006.09.019zbMATH Open1110.52002arXivmath/0605078OpenAlexW2020145866MaRDI QIDQ869905FDOQ869905


Authors: Stéphane Gaubert, Ricardo D. Katz Edit this on Wikidata


Publication date: 9 March 2007

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

Abstract: We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of (Rcupinfty)n can be written as the max-plus convex combination of at most n+1 of the extreme points of this subset. We establish related results for closed max-plus convex cones and closed unbounded max-plus convex sets. In particular, we show that a closed max-plus convex set can be decomposed as a max-plus sum of its recession cone and of the max-plus convex hull of its extreme points.


Full work available at URL: https://arxiv.org/abs/math/0605078




Recommendations




Cites Work


Cited In (47)





This page was built for publication: The Minkowski theorem for max-plus convex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869905)