The Minkowski theorem for max-plus convex sets

By Stephane Gaubert, Ricardo D. Katz. 2006

112 citations recorded by the source corpus.

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

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/efa0ea46cdce35413907da8da34129ad6b35d565

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Stephane Gaubert
  2. Marianne Akian
  3. Zur Izhakian
  4. Alexander E. Guterman
  5. Louis H. Rowen
  6. Manfred Knebusch
  7. Peter Butkovic
  8. Ricardo D. Katz

In Geometry and Topology

  1. Zur Izhakian
  2. Louis H. Rowen
  3. Stephane Gaubert
  4. Marianne Akian
  5. Manfred Knebusch
  6. Alexander E. Guterman
  7. Peter Butkovic
  8. Ricardo D. Katz

Citations in the corpus