Vertex Enumeration Problem

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.

Read more about Vertex Enumeration Problem:  Computational Complexity

Famous quotes containing the word problem:

    It is commonplace that a problem stated is well on its way to solution, for statement of the nature of a problem signifies that the underlying quality is being transformed into determinate distinctions of terms and relations or has become an object of articulate thought.
    John Dewey (1859–1952)