Certifying and repairing solutions to large LPs how good are LP-solvers?
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Software Verification Based on Linear Programming
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
A Comparative Study between Linear Programming Validation (LPV) and other Verification Methods
ASE '99 Proceedings of the 14th IEEE international conference on Automated software engineering
RTL-Datapath Verification using Integer Linear Programming
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Safe bounds in linear and mixed-integer linear programming
Mathematical Programming: Series A and B
Exact solutions to linear programming problems
Operations Research Letters
Operations Research Letters
An exact rational mixed-integer programming solver
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Integration of an LP solver into interval constraint propagation
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Valid Linear Programming Bounds for Exact Mixed-Integer Programming
INFORMS Journal on Computing
| Hi-index | 0.00 |
We present an algorithm that certifies the feasibility of a linear program while using rational arithmetic as little as possible. Our approach relies on computing a feasible solution of the linear program that is as far as possible from satisfying an inequality at equality. To realize such an approach, we have to detect the set of inequalities that can only be satisfied at equality. Compared to previous approaches for this problem our algorithm has a much higher rate of success.