Exterior Point Simplex Algorithm
The exterior point simplex algorithm is a simplex-type algorithm that moves in the exterior of the feasible solution and constructs basic infeasible solutions instead of constructing feasible solutions like simplex algorithm does. This chapter presents the exterior point simplex algorithm. Numerical examples are presented in order for the reader to understand better the algorithm. Furthermore, an implementation of the algorithm in MATLAB is presented. The implementation is modular allowing the user to select which scaling technique and basis update method will use in order to solve LPs. Finally, a computational study over benchmark LPs and randomly generated sparse LPs is performed in order to compare the efficiency of the proposed implementation with the revised primal simplex algorithm presented in Chapter 8.
- 2.Carstens, D. M. (1968) Crashing techniques. In W. Orchard-Hays (Ed.), Advanced linear-programming computing techniques (pp. 131–139). New York: McGraw-Hill.Google Scholar
- 10.Paparrizos, K., Samaras, N., & Tsiplidis, K. (2009). Pivoting algorithms for (LP) generating two paths. Encyclopedia of optimization, 2nd edition, 2965–2969.Google Scholar
- 12.Samaras, N. (2001). Computational improvements and efficient implementation of two path pivoting algorithms. Ph.D. dissertation, Department of Applied Informatics, University of Macedonia.Google Scholar