1 | initial version |
You can try defining the polytope of the set of points satisfying all inequalities. For this, you can have a look at the Polyhedron
constructor as follows:
sage: Polyhedron?
If P
is the polyhedron you constructed, you can try to find an element with the .an_element()
method.
Do not hesitate to ask from more details by explaining what you tried so far.
2 | No.2 Revision |
You can try defining the polytope of the set of points satisfying all inequalities. For this, you can have a look at the Polyhedron
constructor as follows:
sage: Polyhedron?
If P
is the polyhedron you constructed, you can try to find an element with the .an_element()
method.
You can have a look at the backend
option for the Polyhedron
, there is cdd
, normaliz
, polymake
, ppl
, so perhaps one of them implements parallel algorithm.
Do not hesitate to ask from more details by explaining what you tried so far.
3 | No.3 Revision |
You can try defining the polytope of the set of points satisfying all inequalities. For this, you can have a look at the Polyhedron
constructor as follows:
sage: Polyhedron?
If P
is the polyhedron you constructed, you can try to find an element with the .an_element()
method.
You can have a look at the backend
option for the Polyhedron
, constructor, there is cdd
, normaliz
, polymake
, ppl
, so perhaps one of them implements parallel algorithm.
Do not hesitate to ask from more details by explaining what you tried so far.
4 | No.4 Revision |
You can try defining the polytope of the set of points satisfying all inequalities. For this, you can have a look at the Polyhedron
constructor as follows:
sage: Polyhedron?
If P
is the polyhedron you constructed, you can try to find an element with the .an_element()
method.
You can have a look at the backend
option for the Polyhedron
constructor, there is cdd
, normaliz
, polymake
, ppl
, so perhaps one of them implements parallel algorithm.algorithms.
Do not hesitate to ask from more details by explaining what you tried so far.
5 | No.5 Revision |
You can try defining the polytope of the set of points satisfying all inequalities. For this, you can have a look at the Polyhedron
constructor as follows:
sage: Polyhedron?
If P
is the polyhedron you constructed, you can try to find an element with the .an_element()
method.
You can have a look at the backend
option for the Polyhedron
constructor, there is cdd
, normaliz
, polymake
, ppl
, so perhaps one of them implements parallel algorithms.algorithms (however, it is likely that without parallelism, those backends will be faster than the symbolic solver behind solve_ineq
).
Do not hesitate to ask from more details by explaining what you tried so far.