Cookies?
Library Header Image
LSE Research Online LSE Library Services

On finding exact solutions of linear programs in the oracle model

Dadush, Daniel, Végh, László A. ORCID: 0000-0003-1152-200X and Zambelli, Giacomo (2022) On finding exact solutions of linear programs in the oracle model. In: Naor, Joseph (Seffi) and Buchbinder, Niv, (eds.) Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Society for industrial and applied mathematics, 2700 - 2722. ISBN 9781611977073

[img] Text (Dadush-Vegh-Zambelli) - Accepted Version
Download (650kB)

Identification Number: 10.1137/1.9781611977073.106

Abstract

We consider linear programming in the oracle model: mincT x s.t. x ∊ P, where the polyhedron P = {x ∊ ℝn: Ax ≤ b} is given by a separation oracle that returns violated inequalities from the system Ax ≤ b. We present an algorithm that finds exact primal and dual solutions using O(n2 log(n/δ)) oracle calls and O(n4 log(n/δ) + n6 log log(1/δ)) arithmetic operations, where δ is a geometric condition number associated with the system (A, b). These bounds do not depend on the cost vector c. The algorithm works in a black box manner, requiring a subroutine for approximate primal and dual solutions; the above running times are achieved when using the cutting plane method of Jiang, Lee, Song, and Wong (STOC 2020) for this subroutine. Whereas approximate solvers may return primal solutions only, we develop a general framework for extracting dual certificates based on the work of Burrell and Todd (Math. Oper. Res. 1985). Our algorithm works in the real model of computation, and extends results by Grötschel, Lovász, and Schrijver (Prog. Comb. Opt. 1984), and by Frank and Tardos (Combinatorica 1987) on solving LPs in the bit-complexity model. We show that under a natural assumption, simultaneous Diophantine approximation in these results can be avoided.

Item Type: Book Section
Official URL: https://epubs.siam.org/doi/10.1137/1.9781611977073
Additional Information: © 2022 The Authors
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 08 Apr 2022 14:30
Last Modified: 15 Jun 2022 09:54
URI: http://eprints.lse.ac.uk/id/eprint/114633

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics