The Minkowski Theorem for Max-plus Convex Sets
Preprint
Abstract
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.
Keywords
All Related Versions
- Version 1, 2006-05-03, ArXiv
- Published version: Linear Algebra and its Applications, 421 (2-3), 356.
This publication has 12 references indexed in Scilit:
- Max-Plus $(A,B)$-Invariant Spaces and Control of Timed Discrete-Event SystemsIEEE Transactions on Automatic Control, 2007
- Bases in max-algebraLinear Algebra and its Applications, 2004
- Duality and separation theorems in idempotent semimodulesLinear Algebra and its Applications, 2004
- Topologies on lattice ordered groups, separation from closed downward sets and conjugations of type LauOptimization, 2003
- Disjunctive optimization, max-separable problems and extremal algebrasTheoretical Computer Science, 2003
- Downward Sets and their separation and approximation propertiesJournal of Global Optimization, 2002
- Idempotent Functional Analysis: An Algebraic ApproachMathematical Notes, 2001
- Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation **Optimization, 1999
- Max-plus algebra and system theory: Where we are and where to go nowAnnual Reviews in Control, 1999
- Moduloïds and pseudomodules 1. Dimension theoryDiscrete Mathematics, 1991