Certifying feasibility and objective value of linear programs

Abstract We present an algorithm that certifies the feasibility of a linear program and computes a safe bound on its objective value while using rational arithmetic as little as possible. Our approach relies on computing a feasible solution that is as far as possible from satisfying an inequality at equality. To this end, we have to detect the set of inequalities that can only be satisfied at equality. Compared to previous approaches, our algorithm has a much higher success rate.

[1]  Rolf Drechsler,et al.  RTL-datapath verification using integer linear programming , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[2]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

[3]  Jean-Luc Lambert,et al.  A comparative study between linear programming verification (LPV) and other verification methods , 1999, 14th IEEE International Conference on Automated Software Engineering.

[4]  Thorsten Koch.  The final NETLIB-LP results , 2004, Oper. Res. Lett..

[5]  Kurt Mehlhorn,et al.  Certifying and repairing solutions to large LPs how good are LP-solvers? , 2003, SODA '03.

[6]  David S. Watkins,et al.  Fundamentals of matrix computations , 1991 .

[7]  Michael J. Todd,et al.  Identifying the set of always-active constraints in a system of linear inequalities by a single linear program , 1985 .

[8]  Arnold Neumaier,et al.  Safe bounds in linear and mixed-integer linear programming , 2004, Math. Program..

[9]  Nicholas J. Highham.  A survey of condition number estimation for triangular matrices , 1987 .

[10]  William J. Cook,et al.  Exact solutions to linear programming problems , 2007, Oper. Res. Lett..

[11]  Christian Jansson,et al.  Computational Experience with Rigorous Error Bounds for the Netlib Linear Programming Library , 2006, Reliab. Comput..

[12]  Jean-Luc Lambert,et al.  Software Verification Based on Linear Programming , 1999, World Congress on Formal Methods.

[13]  Ernst Althaus,et al.  Integration of an LP Solver into Interval Constraint Propagation , 2011, COCOA.

[14]  Roland Wunderling,et al.  Paralleler und objektorientierter Simplex-Algorithmus , 1996 .

[15]  Ernst Althaus,et al.  Fast and Accurate Bounds on Linear Programs , 2009, SEA.