A projective variant of the approximate center method for the dual linear programming problem

II Mathematical Programming II.3 Linear Programming And Complementarity
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 180)


We deal with a projective path-following method for linear programming. The performance depends on the exponent μ in the numerator of a multiplicative barrier function. The best iteration bound, i.e. O(√nL), occurs for large values of μ, e.g., μ≥2n.


Linear programming interior point method central path path-following method projective method polynomial-time 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    De Ghellinck, G., Vial, J.-Ph. (1986), A Polynomial Newton Method for Linear Programming, Algorithmica 1, 425–453.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    Imai, H. (1987), Extensions of the Multiplicative Barrier Function Method for Linear Programming, Journal of the Operations Research Society of Japan 30, 160–180.zbMATHMathSciNetGoogle Scholar
  3. [3]
    Iri, M. and Imai, H. (1986), A Multiplicative Barrier Function Method for Linear Programming, Algorithmica 1, 455–482.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    Karmarkar, N. (1984), A New Polynomial-Time Algorithm for Linear Programming, Combinatorica 4, 373–395.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    Megiddo, N (1986), Pathways to the Optimal Set in Linear Programming, in: Proceedings of the 7th Mathematical Programming Symposium of Japan, Nagoya, Japan, 1–36.Google Scholar
  6. [6]
    Roos, C. and Vial, J.-Ph. (1988), A Polynomial Method of Approximate Centers for Linear Programming, Mathematical Programming, to appear.Google Scholar
  7. [7]
    T. Tsuchiya (1990), Global Convergence of the Affine Scaling Methods for Degenerate Linear Programming Problems, The Institute of Statistical Mathematics, Tokyo, Japan.Google Scholar
  8. [8]
    Yamashita, H. (1986) A polynomially and Quadratically Convergent Method for Linear Programming, Mathematical Systems Institute, Inc., Tokyo.Google Scholar

Copyright information

© International Federation for Information Processing 1992

Authors and Affiliations

  • C. Roos
    • 1
  1. 1.Faculty of Mathematics and Computer ScienceDelft University of TechnologyDelftNetherlands

Personalised recommendations