On the worst case complexity of potential reduction algorithms for linear programming.

Dimitris Bertsimas Xiaodong Luo

Published in: Math. Program. (1997)

Keyphrases

linear programming
theoretical analysis
times faster
computational complexity
computational cost
real time
interior point
information systems
data structure
orders of magnitude
computational efficiency
recently developed
simplex algorithm