On the Complexity of Linear Programming

Authors

  • Clovis C. Gonzaga Department of Mathematics, Federal University of Santa Catarina

DOI:

https://doi.org/10.11606/resimeusp.v2i2.74801

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.

Downloads

Download data is not yet available.

Downloads

Issue

Vol. 2 No. 2 (1995)

Section

Contents

How to Cite

On the Complexity of Linear Programming. (2014). Resenhas Do Instituto De Matemática E Estatística Da Universidade De São Paulo, 2(2), 197-207. https://doi.org/10.11606/resimeusp.v2i2.74801