Interior-Point Methods for Linear Programming: A Challenge to the Simplex Method

Abstract

The world of mathematical programming has seen a remarkable surge of activity following publication of Karmarkar's projective algorithm in May 1984. A review of the ensuing three years has already appeared. One year later, the authors review some of the main methods and surrounding events, and focus on references that contain computational results. Keywords: Barrier-function methods, Newton's method, Karmarkar's projective method, Problem solving.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1988
Accession Number
ADA198944

Entities

People

  • Michael Saunders
  • Philip Edward Gill
  • Walter Murray

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • California
  • Computations
  • Computer Programming
  • Equations
  • Iterations
  • Linear Algebra
  • Linear Programming
  • Mathematical Programming
  • New Zealand
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Scientific Research
  • Simplex Method
  • United States

Readers

  • Operations Research
  • Strategic Security Studies