An analog of Karmarkar's algorithm for inequality constrained linear programs, with a 'new' class of projective transformations for centering a polytope

  • Authors:

  • Robert M Freund

  • Affiliations:

  • Sloan School of Management, M.I.T., 50 Memorial Drive, Cambridge, MA 02139/ USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an algorithm, analogous to Karmarkar's algorithm, for the linear programming problem: maximize c^Tx subject to Ax =