Adjacent vertex simplex algorithms: More experimental results on random problems

Recent experimental evidence suggests that interior point methods dominate simplex-based methods in the solution of larger scale linear programs. This paper presents the results of experiments with adjacent vertex simplex algorithms on larger problems than those previously reported in the literature. Several of these algorithms provide substantial improvement over Dantzig’s original method. Whether efficient implementations of these algorithms will outperform interior point codes on larger dense and sparse problems remains an open question.