The Efficiency of the Simplex Method: A Survey
DOI10.1287/MNSC.33.3.301zbMATH Open0612.90081OpenAlexW1993541808MaRDI QIDQ3753810FDOQ3753810
Authors: Ron Shamir 
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
Recommendations
surveyupper and lower boundsprobabilistic analysissimplex methodMonte-Carlo methodspractical experience
Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (34)
- Computational aspects of linear programming simplex method
- Algebraic languages for mathematical programming
- Analysis of stochastic problem decomposition algorithms in computational grids
- Title not available (Why is that?)
- A friendly smoothed analysis of the simplex method
- Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1
- Optimization for exaust emission problems by the simplex method
- Estimating the probability that a given vector is in the convex hull of a random sample
- Deciding probabilistic automata weak bisimulation: theory and practice
- Experiments with external pivoting
- A universal scaling theory for complexity of analog computation
- Title not available (Why is that?)
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Mathematical decision-making with linear and convex programming
- Ein effektives simplexverfahren mit teiltableauwahl
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- The simplex method as a global optimizer: A \(C\)-programming perspective
- A Comparison of the Original and Revised Simplex Methods
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- An overview on the simplex algorithm
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory
- Reformulation of the linear program for completely ergodic MDPs with average cost criteria
- On the efficiency of algorithms of analysis
- Upper and lower bounds on the smoothed complexity of the simplex method
- A note on the distribution of the number of simplex iterations to optimality
- A barrier method for dynamic Leontief-type linear programs
- Probabilistic analysis of a differential equation for linear programming
- A computational study of redundancy in randomly generated polytopes
- A characterization theorem and an algorithm for a convex hull problem
- Scaling and universality of the complexity of analog computation
- On the variance of the number of pivot steps required by the simplex algorithm
- An analysis of an available set of linear programming test problems
- Complexity of the gravitational method for linear programming
Uses Software
This page was built for publication: The Efficiency of the Simplex Method: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753810)
