| Article ID: | iaor20084136 |
| Country: | United Kingdom |
| Volume: | 17 |
| Issue: | 4 |
| Start Page Number: | 325 |
| End Page Number: | 332 |
| Publication Date: | Jun 1990 |
| Journal: | Computers and Operations Research |
| Authors: | Eiselt H.A., Sandblom C.-L. |
In this paper we explore a number of strategies for a modification of the primal simplex method called external pivoting. Based on previous experience with this modification three new strategies are developed, described, and subsequently tested on a series of randomly generated problems. The results indicate that the relative savings of some external pivoting strategies increase with increasing problem size.