#18735: MixedIntegerLinearProgram: Reconstruct exact rational basic solution
----------------------------------+------------------------
Reporter: mkoeppe | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: numerical | Resolution:
Keywords: lp | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #18685, #18688 | Stopgaps:
----------------------------------+------------------------
Comment (by dimpase):
Replying to [comment:5 mkoeppe]:
> Replying to [comment:2 dimpase]:
> > Is `ppl` (`ppl`LP backend, which works with exact arithmetic) too slow
for you?
>
> Dima, ppl's implementation of the double description method is very
good, but its LP solver is not suitable for problems of even moderate
sizes.
Would you mind providing an example of PPL choking on an LP doable in
exact arithmetic by another solver? We use PPL's LP solver in
`codesize_upper_bound(...,algorithm="LP")` and never saw a problem...
(Although perhaps the difficulty from entry sizes dominate the the one
from the dimension in this case).
--
Ticket URL: <http://trac.sagemath.org/ticket/18735#comment:6>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" 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-trac.
For more options, visit https://groups.google.com/d/optout.
