A Note on the Structure of the Central Path in Linear Programming

The central path for linear programming instance L(A, b, c) consists of two types of segments: one almost straight and the other curved. In this note we obtain an inequality ⌊ n2 8 ⌋ ≤ Ns ≤ n2 on the total number of segments Ns of the central path and use this inequality to obtain the lower and the upper bounds on the number of iterations Ñ to solve a… CONTINUE READING