Accession Number : AD0637141

Title :   ALGORITHMS FOR FRAMES AND LINEALITY SPACES OF CONES.

Corporate Author : BOEING SCIENTIFIC RESEARCH LABS SEATTLE WASH MATHEMATICS RESEARCH LAB

Personal Author(s) : Wets,Roger J. B. ; Witzgall,Christoph

Report Date : JUN 1966

Pagination or Media Count : 29

Abstract : 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)

Descriptors :   (*ALGORITHMS, *LINEAR PROGRAMMING), CONVEX SETS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE