Ask Your Question

Revision history [back]

Linear Programming: float solving and exact verification

Hi there,

the glpsol tool (GLPK) provides an option "--xcheck": the solver compute the optimal solution uses floating points, and then checks the correctness using exact arithmetics (i guess implicitly they re-check the basis variables, so this only requires one matrix inversation on exact arithmetics)

  1. the MILP interface of sage provides the possibility to set, however, it appears that there is no option to activate "xcheck"? [not allowed to post links but here are the references for the sage documentation]

  2. I know that it is easy to extract the basis variables and to recheck the correctness of a floating-point-solution just within sage, however, I really think this should be added as a basic functionality for the SAGE MILP interface to ANY solver, not only GLPK (so this verification-code should also verify solutions of cplex,gurobi,etc.) .

So, does anyone have already an implementation for such a verification?

Best, Manfred