On Thu, 29 Oct 2015, William Stein wrote:
The same happens for some doctests that rely on optional LP solvers:
they can take <1s with CPLEX/Gurobi, but 'standard sage' (with GLPK)
cannot be expected to ever solve them.
So if a user tries to use them they will be effectively broken?
But do we have "# optional - cplex OR gurobi"? AFAIK no. And to the user
it seems stupid to have
EXAMPLES:
First we try with CPLEX::
sage: x = do_something(42, None) # optional - cplex
'foo'
And now with Gurobi::
sage: x = do_something(42, None) # optional - gurobi
'foo'
--
Jori Mäntysalo
