http://worldcat.org/entity/work/id/137145286

Algorithms for frames and lineality spaces of cones

The frame of a cone C is a minimal set of generators, and the lineality space L of C is the greatest linear subspace contained in C. Algorithms are described for determining the frame and the lineality space of a cone C(S) spanned by a finite set S. These algorithms can be used for determining the vertices, edges, and other faces of low dimension of the convex hull of a finite set H(S). All algorithms are based on the simplex method of linear programming. The problem of finding the lineality space can be successively reduced to problems in spaces of lower dimensions. (Author).

Open All Close All