Abstract
In the simplex method for linear programming the algorithmic step of checking the reduced costs of nonbasic variables is called the “pricing” step. If these reduced costs are all of the “right sign” the current basis (and solution) is optimal, if not, this procedure selects a candidate vector that looks profitable for inclusion in the basis. While theoretically the choice of any profitable vector will lead to a finite termination (provided degeneracy is handled properly) but the number of iterations until termination depends very heavily on the actual choice (which is defined by the selection rule applied). Pricing has long been an area of heuristics to help make better selection. As a result, many different and sophisticated pricing strategies have been developed, implemented and tested. So far none of them is known to be dominating all others in all cases. Therefore, advanced simplex solvers need to be equipped with many strategies so that the most suitable one can be activated for each individual problem instance. In this paper we present a general pricing scheme. It creates a large flexibility in pricing. It is controlled by three parameters. With different settings of the parameters many of the known strategies can be reproduced as special cases. At the same time, the framework makes it possible to define new strategies or variants of them. The scheme is equally applicable to general and network simplex algorithms.
Similar content being viewed by others
References
Benichou, M., J. Gautier, G. Hentges, and G. Ribiere. (1977). “The Efficient Solution of Large-Scale Linear Programming Problems.” Mathematical Programming 13, 280–322.
Bland, R. (1977). “New Finite Pivot Rule for the Simplex Method.” Mathematics of Operations Research 2, 103–107.
Brearley, A., G. Mitra, and H. Williams. (1975). “Analysis of Mathematical Programming Problems Prior to Applying the Simplex Method.” Mathematical Programming 8, 54–83.
Brown, G. and M. Olson. (1994). “Dynamic Factorization in Large-Scale Optimization.” Mathematical Programming 64, 17–51.
Cunningham, W. (1979). “Theoretical Properties of the Network Simplex Method.” Mathematics of Operations Research 4(2), 196–208.
Dantzig, G. (1963). Linear Programming and Extensions. Princeton: Princeton University Press.
Forrest, J. and D. Goldfarb. (1992). “Steepest Edge Simplex Algorithms for Linear Programming.” Mathematical Programming 57(3), 341–374.
Fourer, R. (1983). “Solving Staircase Linear Programs by the Simplex Method, 2: Pricing.” Mathematical Programming 25, 251–292.
Goldfarb, D. and J. Reid. (1977). “A Practicable Steepest-Edge Simplex Algorithm.” Mathematical Programming 12, 361–371.
Greenberg, H. (1978). “Pivot Selection Tactics.” In H. Greenberg (ed.), Design and Implementation of Optimization Software, NATO ASI. Rockville, MD: Sijthoff & Nordhoff, pp. 143–174.
Gülpinar, N., G. Gutin, G. Mitra, and I. Maros. (2000). “Detecting Embedded Networks in LP Using GUB and Independent Set Algorithms.” Computational Optimization and Applications 15(3), 235–247.
Harris, P. (1973). “Pivot Selection Method of the Devex LP Code.” Mathematical Programming 5, 1–28.
Maros, I. (1991). “A Structure Exploiting Pricing Procedure for Network Linear Programming.” Research Report 18-91, RUTCOR, Rutgers University, NJ, USA, 15 p.
Maros, I. (2003). Computational Techniques of the Simplex Method. International Series in Operations Research and Management, Vol. 61. Boston, MA: Kluwer Academic Publishers.
Maros, I. and G. Mitra. (2000). “Investigating the Sparse Simplex Algorithm on a Distributed Memory Multiprocessor.” Parallel Computing 26, 151–170.
Orchard-Hays, W. (1968). Advanced Linear-Programming Computing Techniques. New York: McGraw-Hill.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Maros, I. A General Pricing Scheme for the Simplex Method. Annals of Operations Research 124, 193–203 (2003). https://doi.org/10.1023/B:ANOR.0000004769.36807.cf
Issue Date:
DOI: https://doi.org/10.1023/B:ANOR.0000004769.36807.cf