A primal projective interior point method for linear programming

DOI10.1007/BF01586924zbMath0741.90046MaRDI QIDQ1176804

Donald Goldfarb, Dong Xiao

Publication date: 25 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

polynomial timeprojective interior point algorithm

Mathematics Subject Classification ID

Fractional programming (90C32) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

A fifth bibliography of fractional programming^* ⋮ An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming ⋮ A circular cone relaxation primal interior point algorithm for LP ⋮ Polynomial primal-dual cone affine scaling for semidefinite programming

Cites Work

• A monotonic projective algorithm for fractional linear programming
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A different convergence proof of the projective method for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Conical projection algorithms for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A Self-Correcting Version of Karmarkar’s Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A primal projective interior point method for linear programming