DeepAI AI Chat
Log In Sign Up

Linear Programming using Limited-Precision Oracles

by   Ambros Gleixner, et al.

Since the elimination algorithm of Fourier and Motzkin, many different methods have been developed for solving linear programs. When analyzing the time complexity of LP algorithms, it is typically either assumed that calculations are performed exactly and bounds are derived on the number of elementary arithmetic operations necessary, or the cost of all arithmetic operations is considered through a bit-complexity analysis. Yet in practice, implementations typically use limited-precision arithmetic. In this paper we introduce the idea of a limited-precision LP oracle and study how such an oracle could be used within a larger framework to compute exact precision solutions to LPs. Under mild assumptions, it is shown that a polynomial number of calls to such an oracle and a polynomial number of bit operations, is sufficient to compute an exact solution to an LP. This work provides a foundation for understanding and analyzing the behavior of the methods that are currently most effective in practice for solving LPs exactly.


page 1

page 2

page 3

page 4


Revisiting Tardos's Framework for Linear Programming: Faster Exact Solutions using Approximate Solvers

In breakthrough work, Tardos (Oper. Res. '86) gave a proximity based fra...

Solving p-adic polynomial systems via iterative eigenvector algorithms

In this article, we describe an implementation of a polynomial system so...

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

Following the breakthrough work of Tardos in the bit-complexity model, V...

A Quantum IP Predictor-Corrector Algorithm for Linear Programming

We introduce a new quantum optimization algorithm for Linear Programming...

lrsarith: a small fixed/hybrid arithmetic C library

We describe lrsarith which is a small fixed precision and hybrid arithme...

Complexity Estimates for Fourier-Motzkin Elimination

In this paper, we propose a new method for removing all the redundant in...

On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves

Given a parametric polynomial curve γ:[a,b]→ℝ^n, how can we sample a ran...