#12533: arbitrary precision LP solver backend
----------------------------------+-----------------------------------------
Reporter: dimpase | Owner: ncohen
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.0
Component: linear programming | Keywords: arbitrary precision, LP
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author:
Merged: | Dependencies:
----------------------------------+-----------------------------------------
Comment(by vbraun):
I've added a patch that catches the C++ exceptions and shows how to work
around Cython/C++ issues in `optimizing_point()`.
Things that need to be done:
* `MIP_Problem` should derive from `_mutable_or_immutable` just like the
polyhedron class. All mutating methods need to check that the
`MIP_Problem` is mutable.
* Doctests should be added for all caught C++ exceptions (see PPL
documentation for which methods can raise exceptions)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12533#comment:20>
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.
