#17215: Bounding hyperplanes for polyhedra
-------------------------------------------------+-------------------------
Reporter: darij | Owner:
Type: task | Status: new
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: polytopes, linear | Merged in:
programming, linear optimization | Reviewers:
Authors: | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Description changed by darij:
Old description:
> As far as I recall, a point v on a convex polyhedron P is a vertex of P
> if and only if there exists a vector w in the linear span of P such that
> no real number p satisfies v + pw \in P. Knowing such a w is a good
> certificate for v being a vertex.
>
> Do we have a method for finding such a w ?
New description:
As far as I recall, a point v on a convex polyhedron P is a vertex of P if
and only if there exists an affine hyperplane in the linear span of P
which intersects P only in v. Knowing such a w is a good certificate for v
being a vertex.
Do we have a method for finding such a w ?
--
--
Ticket URL: <http://trac.sagemath.org/ticket/17215#comment:3>
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.
