Lurupa–rigorous error bounds in linear programming. The software part of my dissertation, Lurupa is a tool to rigorously bound the optimal value of a linear program and compute verified enclosures of near optimal feasible points. It is written in pure ANSI C++ and uses the interval library PROFIL/BIAS. In addition a linear programming solver is needed to compute approximate solutions. Currently only lp_solve is supported but modules to link to other solvers are planned and can be easily implemented.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Ninin, Jordan; Messine, Frédéric; Hansen, Pierre: A reliable affine relaxation method for global optimization (2015)
- Adjé, Assalé; Gaubert, Stéphane; Goubault, Eric: Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis (2012)
- Domes, Ferenc; Neumaier, Arnold: Rigorous filtering using linear relaxations (2012)
- Jansson, Christian: On verified numerical computations in convex programming (2009)