"The simplex algorithm for linear programming is of polynomial complexi" by Roger N. Pederson

Skip to main content

Department of Mathematical Sciences

Authors

Roger N. Pederson, Carnegie Mellon University

Title

The simplex algorithm for linear programming is of polynomial complexity

Date of Original Version

1996

Type

Technical Report

COinS