On the big \({\mathcal M}\) in the affine scaling algorithm

DOI10.1007/BF01585161zbMath0804.90088OpenAlexW2027245050MaRDI QIDQ1321664

Tohru Ishihara, Kojima, Masakazu

Publication date: 28 April 1994

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

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

zbMATH Keywords

interior point algorithmaffine scaling algorithmartificial linear program

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

An interior point method for general large-scale quadratic programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A little theorem of the big \({\mathcal M}\) in interior point algorithms
• A new polynomial-time algorithm for linear programming
• Global convergence of the affine scaling methods for degenerate linear programming problems
• Affine-scaling for linear programs with free variables
• An implementation of Karmarkar's algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Local Convergence Properties of New Methods in Linear Programming
• Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems