A hybrid method for linear programming

MaRDI QIDQ2721875zbMATH OpenFDO

Authors Fang Wu, Naihua Xiu

Publication date 11 July 2001

Published in Systems Science and Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

affine scalinglinear programmingsimplex method

Mathematics Subject Classification ID

Linear programming (90C05)

Review text

The authors present a hybrid method for linear programming which combines the search directions used in the simplex and affine scaling methods. Finite convergence of the algorithm is proved and relations to simplex and affine scaling algorithms discussed.

Recommendations

• Publication:4887688
• scientific article; zbMATH DE number 169371
• Convergence results and numerical experiments on a linear programming hybrid algorithm
• A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments
• scientific article; zbMATH DE number 4189470

Cited in

(4)

• Linearization of McCormick relaxations and hybridization with the auxiliary variable method
• A hybrid method fur linearly constrained optimisation problems
• scientific article; zbMATH DE number 169371 (Why is no real title available?)
• A hybrid direction algorithm for solving linear programs

This page was built for publication: A hybrid method for linear programming

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