Download PDFOpen PDF in browser

Tropical linear programming and parametric mean payoff games

17 pagesPublished: June 22, 2012


Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, the tropical analogues of classical linear programming results need to be developed. This motivation leads us to study a general tropical linear programming problem. We construct an associated parametric mean payoff game problem, and show that the optimality of a given point, or the unboundedness of the problem, can be certified by exhibiting a strategy for one of the players having certain infinitesimal properties (involving the value of the game and its derivative) that we characterize combinatorially. In other words, strategies play in tropical linear programming the role of Lagrange multipliers in classical linear programming. We use this idea to design a Newton-like algorithm to solve tropical linear programming problems, by reduction to a sequence of auxiliary mean payoff game problems.

Keyphrases: Discrete Event Systems, disjunctive domains, mean-payoff games, policy iteration, static analysis, tropical algebra

In: Andrei Voronkov, Laura Kovács and Nikolaj Bjorner (editors). WING 2010. Workshop on Invariant Generation 2010, vol 1, pages 94--110

BibTeX entry
  author    = {Stephane Gaubert and Ricardo Katz and Sergei Sergeev},
  title     = {Tropical linear programming and parametric mean payoff games},
  booktitle = {WING 2010. Workshop on Invariant Generation 2010},
  editor    = {Andrei Voronkov and Laura Kovacs and Nikolaj Bjorner},
  series    = {EPiC Series in Computing},
  volume    = {1},
  pages     = {94--110},
  year      = {2012},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2398-7340},
  url       = {},
  doi       = {10.29007/jcrz}}
Download PDFOpen PDF in browser