TY - JOUR
T1 - A Scaled Central Path for Linear Programming
AU - Yuan , Ya-Xiang
JO - Journal of Computational Mathematics
VL - 1
SP - 35
EP - 40
PY - 2001
DA - 2001/02
SN - 19
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/8955.html
KW - Central path, Interior point methods, Linear programming.
AB - <p style="text-align: justify;">Interior point methods are very efficient methods for solving large scale linear programming problems. The central path plays a very important role in interior point methods. In this paper we propose a new central path, which scales the variables. Thus it has the advantage of forcing the path to have roughly the same distance from each active constraint boundary near the solution.</p>