A variant of Karmarkar's linear programming algorithm for problems in standard form

Authors:
David M. Gay
Affiliations:
AT&T Bell Laboratories, Murray Hill, NJ
Venue:
Mathematical Programming: Series A and B
Year:
1987

Citing 0
Cited 2

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

Operations Research Letters
Karmarkar's algorithm and the ellipsoid method

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract