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

DOI10.1016/0167-6377(88)90045-4zbMath0649.90071OpenAlexW1978355934MaRDI QIDQ1106099

Robert M. Freund

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90045-4

zbMATH Keywords

projective transformationKarmarkar's algorithmcenter of the transformed feasible region

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Interior-point algorithms for semi-infinite programming ⋮ Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem ⋮ Cutting planes and column generation techniques with the projective algorithm ⋮ Karmarkar's linear programming algorithm and Newton's method ⋮ A global Newton method. II: Analytic centers

Cites Work

• Unnamed Item
• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A variant of Karmarkar's linear programming algorithm for problems in standard form