#12533: arbitrary precision LP solver backend
-------------------------------------------+--------------------------------
Reporter: dimpase | Owner: ncohen
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-pending
Component: linear programming | Resolution:
Keywords: arbitrary precision, LP | Work issues:
Report Upstream: N/A | Reviewers: David Coudert,
Nathann Cohen, Dmitrii Pasechnik
Authors: Risan | Merged in:
Dependencies: #12553, #13646 | Stopgaps:
-------------------------------------------+--------------------------------
Comment (by vbraun):
The coefficients are currently only converted to the base ring if the
coercion system is required. For example:
{{{
sage: p = MixedIntegerLinearProgram()
sage: x = p.new_variable()
sage: x[1] - x[0] # no coercion addition and negation only
x_0 -1 x_1
sage: 2 * x[1] # ZZ(2) is coerced into the coefficient ring
2.0 x_0
}}}
It would be more consistent if coefficients were always converted into the
base ring, but that would definitely require cooperation from the
backends.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12533#comment:76>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
