George Markowsky
J. Math. Anal. Appl.
It has been a challenge for mathematicians to theoretically confirm the extremely good performance of simplex algorithms for linear programming. We have confirmed that a certain variant of the simplex method solves problems of order m × n in an expected number of steps which is bounded between two quadratic functions of the smaller dimension of the problem. Our probabilistic assumptions are rather weak. © 1984 American Mathematical Society.
George Markowsky
J. Math. Anal. Appl.
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Chai Wah Wu
Linear Algebra and Its Applications
Imran Nasim, Melanie Weber
SCML 2024