Spike Swapping In Basis Reinversion.

Abstract

An important component of a large scale linear programming system is the reinversion routine. This paper addresses an important ancillary technique for implementing a reinversion routine utilizing the well-known P(3) and P(4) pivot agenda algorithms of Hellerman and Rarick. Production of factors during reinversion typically involves a left-to-right pivoting process. Unfortunately, during the left-to-right process, a proposed pivot element of a spike column may be zero, in which case columns are interchanged in an attempt to obtain a pivotable column. In this paper we prove that the only columns In this paper we prove that the only columns which need be considered for the interchange with a nonpivotable spike are other spikes lying to the right within the same external bump. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1979
Accession Number
ADA065501

Entities

People

  • J. L. Kennington
  • R. V. Helgason

Organizations

  • Southern Methodist University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Air Force Facilities
  • Algorithms
  • Classification
  • Core Storage
  • Elimination
  • Engineering
  • Identities
  • Linear Programming
  • Operations Research
  • Production
  • Scientific Research
  • Security

Readers

  • Linear Algebra
  • Systems Analysis and Design