The Efficiency of the Simplex Method: A Survey
From MaRDI portal
Publication:3753810
DOI10.1287/mnsc.33.3.301zbMath0612.90081MaRDI QIDQ3753810
Publication date: 1987
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.33.3.301
survey; probabilistic analysis; upper and lower bounds; simplex method; Monte-Carlo methods; practical experience
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C05: Linear programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
A comprehensive simplex-like algorithm for network optimization and perturbation analysis, On the variance of the number of pivot steps required by the simplex algorithm, Complexity of the gravitational method for linear programming, Experiments with external pivoting, A barrier method for dynamic Leontief-type linear programs, Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial, A computational study of redundancy in randomly generated polytopes, Algebraic languages for mathematical programming, Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set, Random matrix theory for the analysis of the performance of an analog computer: a scaling theory, Scaling and universality of the complexity of analog computation, On the efficiency of algorithms of analysis
Uses Software
