The Minkowski Theorem for Max-plus Convex Sets

Details The Minkowski Theorem for Max-plus Convex Sets The Minkowski Theorem for Max-plus Convex Sets

2006-05-02

arxiv.org/abs/math/0605078v1

Linear Algebra and its Applications 421 (2007), 356--369.

Mathematics

Metric Geometry

13 pages, 4 figures (5 eps files)

Scientific paper

10.1016/j.laa.2006.09.019

We 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.

Affiliated with

Also associated with

No associations

Rating

The Minkowski Theorem for Max-plus Convex Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Minkowski Theorem for Max-plus Convex Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Minkowski Theorem for Max-plus Convex Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-307396