On the Step Size in Karmarkar's Algorithm,

Abstract

The algorithm of Karmarkar for solving linear programs is an interior point to the feasible region of a linear program P. A projective transformation maps the point a to the center of the simplex a sub 0 and leads to a nonlinear program.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1985
Accession Number
ADA154040

Entities

People

  • C. M. Shetty
  • M. B. Daya

Organizations

  • Georgia Tech

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Engineering
  • Industrial Engineering
  • Linear Programming
  • Military Research
  • Systems Engineering

Readers

  • Operations Research