Simplex-type algorithms perform successive pivoting operations (or iterations) in order to reach the optimal solution. The choice of the pivot element at each iteration is one of the most critical steps in simplex-type algorithms. The flexibility of the entering and leaving variable selection allows to develop various pivoting rules. This chapter presents six pivoting rules used in each iteration of the simplex algorithm to determine the entering variable: (i) Bland’s rule, (ii) Dantzig’s rule, (iii) Greatest Increment Method, (iv) Least Recently Considered Method, (v) Partial Pricing rule, and (vi) Steepest Edge rule. Each technique is presented with: (i) its mathematical formulation, (ii) a thorough numerical example, and (iii) its implementation in MATLAB. Finally, a computational study is performed. The aim of the computational study is twofold: (i) compare the execution time of the presented pivoting rules, and (ii) highlight the impact of the choice of the pivoting rule in the number of iterations and the execution time of the revised simplex algorithm.
- 1.Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (1990). Linear programming and network flows. New York: John Wiley & Sons, Inc.Google Scholar
- 7.Fukuda, K. (1982). Oriented matroid programming. Ph.D. Thesis, Waterloo University, Waterloo, Ontario, Canada.Google Scholar
- 9.Gärtner, B. (1995). Randomized optimization by simplex-type methods. Ph.D. thesis, Freien Universität, Berlin.Google Scholar
- 12.Klee, V., & Minty, G. J. (1972). How good is the simplex algorithm. In O. Shisha (ed.) Inequalities – III. New York and London: Academic Press Inc.Google Scholar
- 16.Ploskas, N. (2014). Hybrid optimization algorithms: implementation on GPU. Ph.D. thesis, Department of Applied Informatics, University of Macedonia.Google Scholar
- 21.Thomadakis, M. E. (1994). Implementation and evaluation of primal and dual simplex methods with different pivot-selection techniques in the LPBench environment. A research report. Texas A&M University, Department of Computer Science.Google Scholar
- 26.Ziegler, G. M. (1990). Linear programming in oriented matroids. Technical Report No. 195, Institut für Mathematik, Universität Augsburg, Germany.Google Scholar