> > The PPL backend does not work with integer variables. The GLPK backend > does. You can look at the documentation of the ppl backend, though I > guess you already know this: > > http://www.sagemath.org/doc/reference/numerical/sage/numerical/backends/ppl_backend.html > > > What I said is that the IP solvers, despite the fact that they deal with integer variables, do *not* give reliable results. As far as I know, the scip project http://scip.zib.de/exactmip.shtml is the only one which produces proven results for IP problems, but it is (not yet?) available from Sage. Don't know about glpk with the --exact option. But the performance of glpk is that bad, so that it would probably be close to useless if it could also handle the more expensive exact solving.
-- Peter Mueller -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/groups/opt_out.
