#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:7 mkoeppe]:
> It would be interesting to know how the solvers perform on the kind of
LPs that you have in mind.
LPs I get would be not possible to even enter into a solver without long
integers/rationals.
That's e.g. behind this function call:
{{{
sage: codesize_upper_bound(70,8,2,algorithm="LP")
9695943911863423
}}}
more explicitly, you can do
{{{
sage: v,p,r=delsarte_bound_hamming_space(70,8,2,return_data=True)
sage: p
Mixed Integer Program ( maximization, 71 variables, 148 constraints )
}}}
constrains of `p` have entries as big as 112186277816662845432.
--
Ticket URL: <http://trac.sagemath.org/ticket/18735#comment:8>
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.
