A simple heuristic approach to simplex efficiency

DOI10.1016/0377-2217(82)90177-1zbMath0477.90037OpenAlexW1968013905MaRDI QIDQ1160562

Sheldon M. Ross

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90177-1

zbMATH Keywords

simplex algorithmMarkov chain modelnumber of iterations estimationsimple heuristic approachsimplex efficiency

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (8)

Affirmative action algorithms ⋮ A note on probability assignments in estimating the time to solve linear programs ⋮ A new semigroup technique in Poisson approximation ⋮ Limit Theorems for Record Indicators in Threshold $F^\alpha$-Schemes ⋮ An appraisal of computational complexity for operations researchers ⋮ On the number of jumps of random walks with a barrier ⋮ Low order polynomial bounds on the expected performance of local improvement algorithms ⋮ On Asymptotics of Exchangeable Coalescents with Multiple Collisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A step toward probabilistic analysis of simplex method convergence
• Computational Experience in Solving Linear Programs

This page was built for publication: A simple heuristic approach to simplex efficiency