A modified scaling algorithm for LP

DOI10.1080/02331939008843598MaRDI QIDQ3352838zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in Optimization (Search for Journal in Brave)

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

zbMATH Keywords

interior point methodssimplex methodaffine 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)

Recommendations

• An improved deterministic rescaling for linear programming algorithms
• Implementing an affine scaling algorithm for linear programming
• An Improved LPN Algorithm
• Generalized affine scaling algorithms for linear programming problems
• On the extended iterative proportional scaling algorithm
• A modified SQP algorithm for LCP constrained MP
• On the symmetric affiine scaling algorithm for line programming^*
• A Low Complexity Scaling Method for the Lanczos Kernel in Fixed-Point Arithmetic
• Linear scaling and the DIRECT algorithm

Cites work

• A relaxed version of Karmarkar's method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• 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
• Some experiments with Karmarkar's algorithm for linear programming

Cited in

(1)

• A modification to the LINPACK downdating algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3352838)