Interior-point methods for linear programming: a review
The paper reviews some recent advances in interior-point methods for linear programming and indicates directions in which future progress can be made. Most of the interior-point methods belong to any of three categories: affine-scaling methods, potential reduction methods and central path methods. These methods are discussed together with infeasible interior methods and homogeneous self-dual methods for linear programming. Also discussed are some theoretical issues in interior-point methods like dependence of complexity bounds on some non-traditional measures different from the input length L of the problem. Finally, the paper concludes with remarks on the comparison of interior-point methods with the simplex method based on their performance on NITLIB suite, a standard collection of test problems.