SPARSE MATRIX TECHNIQUES IN TWO MATHEMATICAL PROGRAMMING CODES

Abstract

The authors empirically compared ten pivot selection rules for representing the inverse of a sparse basis in triangularized product form. On examples drawn from actual applications, one of the rules yield inverses that were only slightly less sparse than the original basis. The rule was used in the M5 mathematical programming system and has resulted in substantial reduction in running time.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1969
Accession Number
AD0702047

Entities

People

  • George Bernard Dantzig
  • Robert D. Mcknight
  • Roy P. Harvey
  • Stanley S. Smith

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Computer Programming
  • Computer Science
  • Computers
  • Contracts
  • Inversion
  • Iterations
  • Linear Programming
  • Mathematical Programming
  • Military Research
  • Operations Research
  • Range Finding
  • Simplex Method
  • Sparse Matrix

Readers

  • Linear Algebra
  • Mathematics or Statistics
  • Operations Research