The complexity of the simplex algorithm
By: by James D. Currie.
Series: Carleton-Ottawa mathematical lecture note series,; no. 4 (May 1985); Carleton-Ottawa mathematical lecture note series ;; no. 4.
Publisher: Carleton University, Mathematics and Statistics; University of Ottawa, Mathematics
Published: 1985
Place of publication: [Ottawa]
Language: eng
Number of pages: 64
Subjects: Linear programming.
Notes: Bibliography: p. 64.
Thesis (masters)--Carleton University, 1984.