A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm

DOI10.1145/367390.367411zbMath0111.17301OpenAlexW2078111278MaRDI QIDQ3846724

J. C. Dickson, F. P. Frederick

Publication date: 1960

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/367390.367411

zbMATH Keywords

applications of probability theory and statistics

Related Items

Pivot selection methods of the Devex LP code, On scaling linear programs—some experimental results, Testing of a large-scale network optimization program, A practicable steepest-edge simplex algorithm, Solving Large Scale Generalized Networks, Adjacent vertex simplex algorithms: More experimental results on random problems