Vertex enumeration problem: Difference between revisions

Revision as of 18:15, 14 July 2016

Revision as of 12:56, 20 June 2017

Line 1:

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 [[vertex (geometry)|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]]:<ref>[[Eric W. Weisstein]] ''CRC Concise Encyclopedia of Mathematics,'' 2002, ISBN {{isbn|1-58488-347-2}}, p. 3154, article "vertex enumeration"</ref>

:<math>Ax \leq b</math>