The Minkowski Theorem for Max-plus Convex Sets

dc.creatorGaubert, Stephane
dc.creatorKatz, Ricardo
dc.date2006-05-02
dc.date.accessioned2026-07-07T07:42:19Z
dc.date.available2026-07-07T07:42:19Z
dc.descriptionWe establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of $(R\cup\{-\infty\})^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.
dc.description13 pages, 4 figures (5 eps files)
dc.identifierhttps://arxiv.org/abs/math/0605078
dc.identifierhttp://arxiv.org/abs/math/0605078
dc.identifierLinear Algebra and its Applications 421 (2007), 356--369.
dc.identifierdoi:10.1016/j.laa.2006.09.019
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122401
dc.subjectMetric Geometry
dc.subjectOptimization and Control
dc.subject52A01; 16Y60, 46A55
dc.titleThe Minkowski Theorem for Max-plus Convex Sets
dc.typetext

Files

Collections