This thesis compares five common implementations of the Revised Simplex Method, a popular algorit...
| Date | Contributor | Description | Rating |
|---|---|---|---|
| 19 Jun 2009 | MATLAB Central Team |
This thesis compares five common implementations of the Revised Simplex Method, a popular algorithm for solving linear optimization problems.The particular implementations includes the original Revised Simplex Method, the Bartels-Golub Method, the Sparse Bartels-Golub Method, the Forrest-Tomlin Method, and Reid's Method. Each were implemented in MATLAB scripts and tested for total number of floating point operations, maximum data storage, and number of basis refactorizations. |
| Tag | Applied By | Date/Time |
|---|---|---|
| optimization | Dahua Lin | 14 Apr 2011 at 6:44pm |
| optimization | MATLAB Central Team | 19 Jun 2009 at 10:19am |