中文

The Minkowski Theorem for Max-plus Convex Sets

度量几何 2007-05-23 v1 最优化与控制

摘要

We establish the following max-plus analogue of Minkowski's theorem. Any point of a compact max-plus convex subset of (R{})n(R\cup\{-\infty\})^n can be written as the max-plus convex combination of at most n+1n+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.

关键词

引用

@article{arxiv.math/0605078,
  title  = {The Minkowski Theorem for Max-plus Convex Sets},
  author = {Stephane Gaubert and Ricardo Katz},
  journal= {arXiv preprint arXiv:math/0605078},
  year   = {2007}
}

备注

13 pages, 4 figures (5 eps files)