On Large-Scale Linear Programming.

Abstract

Three classes of methods are proposed for solving large-scale linear programs. First, sequential projection is applied to reformulate the linear program as a dynamic program. Second, the revised simplex method using a special factorization for the basis is considered. Third, a class of feasible direction methods is presented. A comparison of these three classes is made. A probabilistic model is developed to estimate computational effort for matrix multiplications. This model is applied to estimate computational effort for linear programming algorithms.

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1975
Accession Number
ADA016180

Entities

People

  • Markku Juhani Kallio

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Linear Programming
  • Mathematical Models
  • Mathematics
  • Models
  • Operations Research
  • Probabilistic Models
  • Simplex Method

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Operations Research