Interior Point Methods

Part of the Springer Optimization and Its Applications book series (SOIA, volume 127)


Nowadays, much attention is focused on primal-dual Interior Point Methods (IPMs) due to their great computational performance. IPMs have permanently changed the landscape of mathematical programming theory and computation. Most primal-dual IPMs are based on Mehrotra’s Predictor-Corrector (MPC) method. In this chapter, a presentation of the basic concepts of primal-dual IPMs is performed. Next, we present the MPC method. The various steps of the algorithm are presented. Numerical examples are also presented in order for the reader to understand better the algorithm. Furthermore, an implementation of the algorithm in MATLAB is presented. Finally, a computational study over benchmark LPs and randomly generated sparse LPs is performed in order to compare the efficiency of the proposed implementation with MATLAB’s IPM solver.

Supplementary material (3 kb)
ipdipm (Zip 3 kb)


  1. 1.
    Bixby, E. R. (1992). Implementing the simplex method: The initial basis. ORSA Journal on Computing, 4, 267–284.MathSciNetCrossRefGoogle Scholar
  2. 2.
    Dantzig, G. B. (1949). Programming in linear structure. Econometrica, 17, 73–74.CrossRefGoogle Scholar
  3. 3.
    Frisch, K. F. (1955). The logarithmic potential method of convex programming. Technical report, University Institute of Economics, Oslo, Norway.Google Scholar
  4. 4.
    Gondzio, J. (1992). Splitting dense columns of constraint matrix in interior point methods for large-scale linear programming. Optimization, 24, 285–297.MathSciNetCrossRefGoogle Scholar
  5. 5.
    Gondzio, J. (1996). Multiple centrality corrections in a primal-dual method for linear programming. Computational Optimization and Applications, 6, 137–156.MathSciNetCrossRefGoogle Scholar
  6. 6.
    Gondzio, J. (2012). Interior point methods 25 years later. European Journal of Operational Research, 218(3), 587–601.MathSciNetCrossRefGoogle Scholar
  7. 7.
    Gonzaga, C. C. (1992). Path-following methods for linear programming. SIAM Review, 34(2), 167–224.MathSciNetCrossRefGoogle Scholar
  8. 8.
    Hoffman, A. J., Mannos, M., Sokolowsky, D., & Wiegman, N. (1953). Computational experience in solving linear programs. Journal of the Society for Industrial and Applied Mathematics, 1, 17–33.MathSciNetCrossRefGoogle Scholar
  9. 9.
    Karmarkar, N. K. (1984). A new polynomial-time algorithm for linear programming. Combinatorica, 4, 373–395.MathSciNetCrossRefGoogle Scholar
  10. 10.
    Khachiyan, L. G. (1979). A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20, 191–194.zbMATHGoogle Scholar
  11. 11.
    Lustig, I. J., Marsten, R. E., & Shanno, D. F. (1992). On implementing Mehrotra’s predictor corrector interior point method for linear programming. SIAM Journal on Optimization, 2, 435–449.MathSciNetCrossRefGoogle Scholar
  12. 12.
    Lustig, I. J., Marsten, R. E., & Shanno, D. F. (1994). Interior point methods for linear programming: Computational state of the art. ORSA Journal on Computing, 6(1), 1–14.MathSciNetCrossRefGoogle Scholar
  13. 13.
    Mehrotra, S. (1992). On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 2, 575–601.MathSciNetCrossRefGoogle Scholar
  14. 14.
    Potra, F. A., & Wright, S. J. (2000). Interior-point methods. Journal of Computational and Applied Mathematics, 124(1), 281–302.MathSciNetCrossRefGoogle Scholar
  15. 15.
    Von Neumann, J. (1947). On a maximization problem. Technical report, Institute for Advanced Study, Princeton, NJ, USA.Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Applied InformaticsUniversity of MacedoniaThessalonikiGreece

Personalised recommendations