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:

    Theology, I am persuaded, derives its initial impulse from a religious wavering; for there is quite as much, or more, that is mysterious and calculated to awaken scientific curiosity in the intercourse with God, and it [is] a problem quite analogous to that of theology.
    Charles Sanders Peirce (1839–1914)