Papers
Topics
Authors
Recent
Search
2000 character limit reached

Short simplex paths in lattice polytopes

Published 12 Dec 2019 in math.OC and cs.CG | (1912.05712v2)

Abstract: The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope PP contained in [0,k]n[0,k]^n and defined via mm linear inequalities. Our first contribution is a simplex algorithm that reaches an optimal vertex by tracing a path along the edges of PP of length in O(n4klog⁡(nk)O(n^4 k\log(nk). The length of this path is independent from mm and it is the best possible up to a polynomial function. In fact, it is only polynomially far from the worst-case diameter, which roughly grows as a linear function in nn and kk. Motivated by the fact that most known lattice polytopes are defined via 0,±10,\pm 1 constraint matrices, our second contribution is an iterative algorithm which exploits the largest absolute value α\alpha of the entries in the constraint matrix. We show that the length of the simplex path generated by the iterative algorithm is in O(n2klog⁡(nkα))O(n^2k \log(nk\alpha)). In particular, if α\alpha is bounded by a polynomial in n,kn, k, then the length of the simplex path is in O(n2klog⁡(nk))O(n^2k \log(nk)). For both algorithms, the number of arithmetic operations needed to compute the next vertex in the path is polynomial in nn, mm and log⁡k\log k. If kk is polynomially bounded by nn and mm, the algorithm runs in strongly polynomial time.

Authors (2)
Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.