A path-following version of the Todd-Burrell procedure for linear programming

DOI10.1007/BF01217688zbMath0889.90112OpenAlexW2085811669MaRDI QIDQ1374685

Jean-Philippe Vial

Publication date: 10 December 1997

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01217688

zbMATH Keywords

interior point methodpath-followingprojective algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• 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 polynomial Newton method for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A survey of search directions in interior point methods for linear programming
• A Path-Following Projective Interior Point Method for Linear Programming
• Short Steps with Karmarkar’s Projective Algorithm for Linear Programming

This page was built for publication: A path-following version of the Todd-Burrell procedure for linear programming