Solving Linear Programs without Breaking Abstractions
Journal of the ACM
MetadataShow full item record
Anderson, M., Dawar, A., & Holm, B. (2015). Solving Linear Programs without Breaking Abstractions. Journal of the ACM, 62 (48)https://www.repository.cam.ac.uk/handle/1810/251099
We show that the ellipsoid method for solving linear programs can be implemented in a way that respects the symmetry of the program being solved. That is to say, there is an algorithmic implementation of the method that does not distinguish, or make choices, between variables or constraints in the program unless they are distinguished by properties definable from the program. In particular, we demonstrate that the solvability of linear programs can be expressed in fixed-point logic with counting (FPC) as long as the program is given by a separation oracle that is itself definable in FPC. We use this to show that the size of a maximum matching in a graph is definable in FPC. This settles an open problem first posed by Blass, Gurevich and Shelah [Blass et al. 1999]. On the way to defining a suitable separation oracle for the maximum matching program, we provide FPC formulas defining canonical maximum flows and minimum cuts in undirected capacitated graphs.
linear programming, maximum matching, ellipsoid method, fixed-point logic with counting, choiceless polynomial time
Research supported by EPSRC grant EP/H026835.
This record's URL: https://www.repository.cam.ac.uk/handle/1810/251099