Maintaining a Sparse Inverse in the Simplex Method

Abstract

The paper reviews and compares some new methods which have recently been proposed for updating the inverse in the simplex method. All of these new methods assume an elimination form of inverse, which has lately been shown to be superior to the old product form. Some computational experiments comparing what appears to be the most promising of these new methods with the standard product form method are described and the results appear encouraging. Some suggestions for implementation of this method in a large-scale production LP code are also given. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1970
Accession Number
AD0717073

Entities

People

  • John A. Tomlin

Organizations

  • Stanford University

Tags

Communities of Interest

  • Autonomy
  • Counter IED
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Core Storage
  • Data Storage Systems
  • Elimination
  • Inversion
  • Iterations
  • Linear Programming
  • Operations Research
  • Parallel Computing
  • Parallel Processing
  • Simplex Method
  • Sparse Matrix
  • Standards
  • United States
  • United States Government

Fields of Study

  • Mathematics

Readers

  • Computational Modeling and Simulation
  • Linear Algebra
  • Operations Research