In mathematics, the vertex enumeration problem for a polytope, a polyhedral cell complex, a hyperplane arrangement, or some other object of discrete geometry, is the problem of determination of the object's vertices given some formal representation of the object. A classical example is the problem of enumeration of the vertices of a convex polytope specified by a set of linear inequalities: where A is an m×n matrix, x is an n×1 column vector of variables, and b is an m×1 column vector of constants.
Attributes  Values 

rdf:type 

rdfs:label 

rdfs:comment 

sameAs  
dct:subject  
Wikipage page ID 

Wikipage revision ID 

Link from a Wikipage to another Wikipage 

foaf:isPrimaryTopicOf  
prov:wasDerivedFrom  
has abstract 

http://purl.org/voc/vrank#hasRank  
is Link from a Wikipage to another Wikipage of  
is Wikipage redirect of  
is foaf:primaryTopic of 