The Minkowski theorem for max-plus convex sets
✍ Scribed by Stéphane Gaubert; Ricardo D. Katz
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 211 KB
- Volume
- 421
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
✦ Synopsis
We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of (R ∪ {-∞}) 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 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.
📜 SIMILAR VOLUMES
A set S in 1 :" is said to he X,-convex if and only if S does not contain a visually independent subset having cardinality h', . It is natural tts ask when an h',-convex set may be expressed as a countable unI.,n of convex sets. Here i! is proved that if S is a closed h',-convex set in the plane and
We study the Laplace transform on Hardy spaces on a class of convex domains in C n . We obtain a Paley-Wiener theorem with a norm that characterizes the entire functions of exponential type which occur as Laplace transforms. This is done by using the Fantappiè transform and the Borel transform to re