A new variant of the primal affine scaling algorithm for linear programs

DOI10.1080/02331939108843712zbMath0742.90054OpenAlexW2032418981MaRDI QIDQ3979522

Shu-Cherng Fang, Gwo-Ming Jan

Publication date: 26 June 1992

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939108843712

zbMATH Keywords

primal affine scaling algorithm

Mathematics Subject Classification ID

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

Related Items (5)

A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem ⋮ An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming ⋮ Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points ⋮ A circular cone relaxation primal interior point algorithm for LP ⋮ Polynomial primal-dual cone affine scaling for semidefinite programming

Cites Work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• La méthode des centres dans un espace topologique
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An experimental approach to karmarkar’s projective method for linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new variant of the primal affine scaling algorithm for linear programs