ALGORITHMS FOR FRAMES AND LINEALITY SPACES OF CONES.

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)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1966
Accession Number
AD0637141

Entities

People

  • Christoph Witzgall
  • Roger J. B. Wets

Organizations

  • Boeing

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Cooperation
  • Evolutionary Algorithms
  • Generators
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics

Readers

  • Critical Infrastructure Protection in CBRN and WMD Threats.
  • Image Processing and Computer Vision.
  • Operations Research

Technology Areas

  • Space
  • Space - Hall-Effect Thruster