A scaled central path for linear programming

MaRDI QIDQ2708326zbMATH OpenFDO

Authors Yaxiang Yuan

Publication date 17 April 2001

Published in Journal of Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

interior point methodslinear programmingscaled central path

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Review text

The author has worked on interior point methods which are one of the most intensively studied topics in linear programming. Many papers have already appeared on interior point methods. In this paper the author proposes a new central path called scaled central path which scales the variables. The author uses this scaled central path to obtain search directions for solving linear programming problems.NEWLINENEWLINENEWLINEThe material is nicely organized and presentation is clear. The paper brings up on much and interesting material.

Recommendations

• Some recent advances and new directions in interior point methods for linear programming
• Insights into the interior-point methods
• scientific article; zbMATH DE number 946715
• Interior-point methods for linear programming: a review
• Scaling, shifting and weighting in interior-point methods

Cited in

(2)

• Scaling, shifting and weighting in interior-point methods
• Some non-interior path-following methods based on a scaled central path for linear complementarity problems

This page was built for publication: A scaled central path for linear programming

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