Universidade de São Paulo. Instituto de Matemática e Estatística
Abstract
In this paper we show a simple treatment of the complexity of Linear Programming. We describe the short step primal-dual path following algorithm and show that it solves the linear programming problem
