Abstract
A dual phase-1 algorithm for the simplex method that handles all types of variables is presented. In each iteration it maximizes a piecewise linear function of dual infeasibilities in order to make the largest possible step towards dual feasibility with a selected outgoing variable. The algorithm can be viewed as a generalization of traditional phase-1 procedures. It is based on the multiple use of the expensively computed pivot row. By small amount of extra work per iteration, the progress it can make is equivalent to many iterations of the traditional method. While this is its most important feature, it possesses some additional favorable properties, namely, it can be efficient in coping with degeneracy and numerical difficulties. Both theoretical and computational issues are addressed. Some computational experience is also reported which shows that the potentials of the method can materialize on real world problems.
Similar content being viewed by others
References
V. Chvátal, Linear Programming, Freeman and Co., 1983.
G.B. Dantzig, Linear Programming and Extensions, Princeton University Press: Princeton, N.J., 1963.
J.J. Forrest and D. Goldfarb, “Steepest edge simplex algorithms for linear programming,” Mathematical Programming, vol. 57, no. 3, pp. 341-374, 1992.
R. Fourer, “Notes on the dual simplex method,” Unpublished, March, 1994.
D.M. Gay, “Electronic mail distribution of linear programming test problems,” COAL Newsletter,Mathematical Programming Society, vol. 13, pp. 10-12, 1985.
H.J. Greenberg, “Pivot selection tactics,” in Design and Implementation of Optimization Software. H.J. Greenberg (Ed.), Sijthoff and Nordhoff, 1978, pp. 109-143.
P.M.J. Harris, “Pivot selection method of the devex LP code,” Mathematical Programming, vol. 5, pp. 1-28, 1973.
C.E. Lemke, “The dual method of solving the linear programming problem,” Naval Research Logistics Quarterly, vol. 1, pp. 36-47, 1954.
I. Maros, “A general phase-I method in linear programming,” European Journal of Operational Research, vol. 23, pp. 64-77, 1986.
I. Maros, “A piecewise linear dual procedure in mixed integer programming,” in New Trends in Mathematical Programming. F. Giannesi, R. Schaible and S. Komlosi (Eds.), Kluwer Academic Publishers, 1998, pp. 159-170.
I. Maros and G. Mitra, “Simplex algorithms,” ch. 1, in Advances in Linear and Integer Programming. J. Beasley (Ed.), Oxford University Press, 1996, pp. 1-46.
W. Orchard-Hays, Advanced Linear-Programming Computing Techniques, McGraw-Hill, 1968.
M. Padberg, Linear Optimization and Extensions, Springer, 1995.
Ph. Wolfe, “A technique for resolving degeneracy in linear programming,” SIAM Journal of Applied Mathematics, vol. 11, pp. 205-211, 1963.
Ph. Wolfe, “The composite simplex algorithm,” SIAM Review, vol. 7, no. 1, pp. 42-54, 1965.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Maros, I. A Piecewise Linear Dual Phase-1 Algorithm for the Simplex Method. Computational Optimization and Applications 26, 63–81 (2003). https://doi.org/10.1023/A:1025102305440
Issue Date:
DOI: https://doi.org/10.1023/A:1025102305440