A relaxed primal-dual path-following algorithm for linear programming

DOI10.1007/BF02206816zbMath0848.90082OpenAlexW1988243648MaRDI QIDQ1915911

Chih-Hung Lin, Tsung-Min Hwang, Wen-Wei Lin

Publication date: 1 July 1996

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

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

zbMATH Keywords

relaxation methodprimal-dual interior path-following algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
• A relaxed version of Karmarkar's method
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems

This page was built for publication: A relaxed primal-dual path-following algorithm for linear programming