A modified scaling algorithm for LP

DOI10.1080/02331939008843598zbMath0728.90058OpenAlexW2008260429MaRDI QIDQ3352838

No author found.

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

simplex methodinterior point methodsaffine scalinggood starting vertices

Mathematics Subject Classification ID

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

Cites Work

• Convergence results and numerical experiments on a linear programming hybrid algorithm
• Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
• A relaxed version of Karmarkar's method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Some experiments with Karmarkar's algorithm for linear programming

This page was built for publication: A modified scaling algorithm for LP