A Path-Following Method
In this chapter, we define an interior-point method for linear programming that is called a path-following method. Recall that for the simplex method we required a two-phase solution procedure. The path-following method is a one-phase method. This means that the method can begin from a point that is neither primal nor dual feasible and it will proceed from there directly to the optimal solution.
KeywordsSimplex Method Linear Complementarity Problem Central Path Step Direction Primal Feasibility
Unable to display preview. Download preview PDF.
- Kojima, M., Mizuno, S. & Yoshise, A. (1989), A primal-dual interior point algorithm for linear programming, in N. Megiddo, ed., ‘Progress in Mathematical Programming’, Springer-Verlag, New York, pp. 29–47.Google Scholar
- Khachian, L. (1979), ‘A polynomial algorithm in linear programming’, Doklady Academiia Nauk SSSR 244, 191–194. In Russian. English Translation: Soviet Mathematics Doklady 20: 191-194.Google Scholar
- Todd, M. (1995), Potential-reduction methods in mathematical programming, Technical Report 1112, SORIE, Cornell University, Ithaca, Ithaca.Google Scholar
- Anstreicher, K. (1996), Potential Reduction Algorithms, Technical report, Department of Management Sciences, University of Iowa.Google Scholar
- Wright, S. (1996), Primal-Dual Interior-Point Methods, SIAM, Philadelphia, USA.Google Scholar