The Factorization Approach to Large-Scale Linear Programming,

Abstract

A unifying concept for large-scale linear programming is developed. This approach called 'factorization' allows one to isolate the effect of different types of constraints and variables in the algebraic representation of the tableau. Two different factorizations based on a double representation of the basic tableau are presented. The use of factorization to obtain efficient algorithms for generalized upper bounding and block diagonal constraints as well as the general network problem is discussed. Computational results for a new network algorithm based on factorization are presented. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1973
Accession Number
AD0768876

Entities

People

  • G. W. Graves
  • R. D. Mcbride

Organizations

  • University of California, Los Angeles

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematics
  • Simplex Method

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Engineering