Probabilistic analysis of an infeasible-interior-point algorithm for linear programming

We consider an infeasible-interior-point algorithm, endowed with a finite termination scheme, applied to random linear programs generated according to a model of Todd. Such problems have degenerate optimal solutions, and possess no feasible starting point. We use no information regarding an optimal solution int he initialization of the algorithm Our main result is that the expected number of iterations before termination with an exact optimal solution is O(n ln(n)).