paper

The Minkowski Theorem for Max-plus Convex Sets

arXiv:math/0605078 · doi:10.1016/j.laa.2006.09.019

Abstract

We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of can be written as the max-plus convex combination of at most 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.

13 pages, 4 figures (5 eps files)

References in corpus (1)

Cited by in corpus (3)

The Minkowski Theorem for Max-plus Convex Sets · wovepaper