摘要: In this book, pivot rules used in the dual simplex method are referred to as rule. Like primal context, a rule is crucial algorithm’s efficiency.
springer.com
sci-hub.st 参考文章(239)
Y. Ye, Eliminating columns in the simplex method for linear programming Journal of Optimization Theory and Applications. ,vol. 63, pp. 69- 77 ,(1989) , 10.1007/BF00940732
Jian-Feng Hu, Short communication: A note on an improved initial basis for the simplex algorithm Computers & Operations Research. ,vol. 34, pp. 3397- 3401 ,(2007) , 10.1016/J.COR.2006.02.004
Philip E. Gill, Walter Murray, Michael A. Saunders, Matgaret H. Wright, Maintaining LU factors of a general sparse matrix Linear Algebra and its Applications. ,vol. 88-89, pp. 239- 270 ,(1987) , 10.1016/0024-3795(87)90112-1
John A. Tomlin, On pricing and backward transformation in linear programming ,(1972)
Robert G. Bland, New Finite Pivoting Rules for the Simplex Method Mathematics of Operations Research. ,vol. 2, pp. 103- 107 ,(1977) , 10.1287/MOOR.2.2.103
M. L. Balinski, A. W. Tucker, Duality Theory of Linear Programs: A Constructive Approach with Applications SIAM Review. ,vol. 11, pp. 347- 377 ,(1969) , 10.1137/1011060
Ping-Qi Pan, A projective simplex method for linear programming Linear Algebra and its Applications. ,vol. 292, pp. 99- 125 ,(1999) , 10.1016/S0024-3795(99)00010-5
M. C. Cheng, General criteria for redundant and nonredundant linear inequalities Journal of Optimization Theory and Applications. ,vol. 53, pp. 37- 42 ,(1987) , 10.1007/BF00938815
Sanjay Mehrotra, On the Implementation of a Primal-Dual Interior Point Method Siam Journal on Optimization. ,vol. 2, pp. 575- 601 ,(1992) , 10.1137/0802028
Robert J. Vanderbei, Marc S. Meketon, Barry A. Freedman, A modification of karmarkar's linear programming algorithm Algorithmica. ,vol. 1, pp. 395- 407 ,(1986) , 10.1007/BF01840454