#12533: arbitrary precision LP solver backend
----------------------------------+-----------------------------------------
Reporter: dimpase | Owner: ncohen
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-5.0
Component: linear programming | Keywords: arbitrary precision, LP
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
----------------------------------+-----------------------------------------
Comment(by dimpase):
Replying to [comment:4 ncohen]:
> 865 elif solver == "PPL":
indeed, PPL is a standard package now (I guess this check for its
availability stems from some early code, when
it wasn't standard). So this check should be removed.
Then, it needs an example where one can see the benefit of the arbitrary
precision (already an example with 2 variables
should do). The example I got from the author (Hi, Risan!). I modified the
last line, as it was following an old design:
{{{
p = MixedIntegerLinearProgram(solver = "PPL")
x = p.new_variable()
n =
100000000000000000000000000000000000000000000000000000000000000000000000000000000000000
p.set_objective(10 * n * x[1] + 50 * n * x[2])
p.add_constraint(10 * n * x[1] + 2 * n * x[2], max = 40 * n)
p.add_constraint(15 * n * x[1] + 30 * n * x[2], max = 40 * n)
print p.solve()
print p.solve(exact=True)
}}}
is probably good enough.
Lastly, the parameter {{{as_vector}}} should be set to {{{False}}} by
default, not to {{{True}}}, to be consistent with the
other LP interfaces.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12533#comment:5>
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.
