A Note on Nonlinear Approaches to Linear Programming.

Abstract

Certain new approaches to linear programming have recently received considerable publicity because of the promise of substantial improvements in efficiency compared to the simplex method. This note briefly discusses several research directions in methods for solving linear programs using nonlinear problem transformations. In particular, we describe application of a barrier transformation to the dual, and the development of sparse least-squares methods based on the LU factorization of the least-squares matrix of its transpose. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1986
Accession Number
ADA168698

Entities

People

  • Margaret H. Wright
  • Michael Saunders
  • Philip Edward Gill
  • Walter Murray

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Convex Programming
  • Differential Equations
  • Equations
  • Least Squares Method
  • Linear Algebra
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • New York
  • Numerical Analysis
  • Operations Research
  • Optimization
  • Simplex Method
  • Statistics

Readers

  • Linear Algebra
  • Operations Research
  • Systems Analysis and Design