Abstract
We develop a tropical analogue of the simplex algorithm for linear programming. In particular, we obtain a combinatorial algorithm to perform one tropical pivoting step, including the computation of reduced costs, in O(n(m + n)) time, where m is the number of constraints and n is the dimension.
| Original language | English |
|---|---|
| Pages (from-to) | 751-795 |
| Number of pages | 45 |
| Journal | SIAM Journal on Discrete Mathematics |
| Volume | 29 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 2015 |
Keywords
- Linear programming
- Simplex method
- Tropical geometry