Finding Better Starting Bases for the Simplex Method
暂无分享,去创建一个
In the last two decades a number of algorithmic units of the simplex method have undergone repeated revisions with a view to improving the computational performance of the simplex based solvers. This research has lead to considerable progress such that the state-of-the-art solvers are approximately two orders of magnitude faster than their predecessors in the’70s.
[1] William Orchard-Hays,et al. Advanced Linear-Programming Computing Techniques , 1968 .
[2] Nicholas I. M. Gould,et al. New crash procedures for large systems of linear constraints , 1989, Math. Program..
[3] Gautam Mitra,et al. Simplex algorithms , 1996 .
[4] Robert E. Bixby,et al. Implementing the Simplex Method: The Initial Basis , 1992, INFORMS J. Comput..