The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study

European Journal of Operational Research

Volumn 101, Issue 1, 1997, Pages 164-176

  Pan, Ping Qi ^a  

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

Dual feasibility; Linear programming; Obtuse angle; Pivot rule

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; FORTRAN (PROGRAMMING LANGUAGE); FUNCTION EVALUATION;

PIVOT RULES;

LINEAR PROGRAMMING;

EID: 0031197587     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00027-6     Document Type: Article

References (19)

1. Beale, E.M.L. (1954), "An alternative method for linear programming", Proceedings of Cambridge Philosophical Society 50, 513-523.
2. Dantzig, G.B. (1954), "The Dual simplex algorithm", RAND Report RM-1270, The RAND Corporation, Santa Monica, CA.
3. Dantzig, G.B. (1963), Linear Programming and Extensions, Princeton University Press, Princeton, NJ.
4. Dantzig, G.B., Orden, A., and Wolfe, P. (1955), "The generalized simplex method for minimizing a linear form under linear inequality restraints", Pacific Journal of Mathematics 5, 183-195.
5. Forrest, J.J.H., and Goldfarb, D. (1992), "Steepest-edge simplex algorithms for linear programming", Mathematical Programming 57, 341-374.
6. Forrest, J.J.H., and Tomlin, J.A. (1990), "Vector processing in simplex and interior methods for linear programming", Annals of Operations Research 22, 71-100.
7. Gay, D.M. (1985), "Electronic mail distribution of linear programming test problems", Mathematical Programming Society COAL Newsletter 13, 10-12.
8. Goldfarb, D. (1976), "Using the steepest-edge simplex algorithm to solve sparse linear programs", in: J. Bunch and D. Rose, eds., Sparse Matrix Computations, Academic Press, New York, 227-240.
9. Goldfarb, D., and Reid, J.K. (1977), "A practicable steepest-edge simplex algorithm", Mathematical Programming 12, 361-371.
10. Greenberg, H.-J. (1978), "Pivot selection tactics", in: H.J. Greenberg, ed., Design and Implementation of Optimization software, Sijthoff and Noordhoff, 109-143.
11. Harris, P.M.J. (1973), "Pivot selection methods of the Devex LP code", Mathematical Programming 5, 1-28.
12. Murtagh, B., and Saunders, M. (1987), "MINOS 5.1 user's guide", Technical Report, SOL 83-20R, revised version, Stanford.
13. Lemke, C.E. (1954), "The dual method of solving the linear programming problem", Naval Research Logistics Quarterly 1, 36-47.
14. Pan, P.-Q. (1990), "Practical finite pivoting rules for the simplex method", OR Spektrum 12, 219-225.
15. Pan, P.-Q. (1994a), "Ratio-test-free pivoting rules for a dual Phase-1 method", in: S.-T Xiao, and F. Wu, eds., Proceedings of the Third Conference of Chinese SIAM, Tsinghua University Press, Beijing, 245-249.
16. Pan, P.-Q. (1994b), "Achieving primal feasibility under the dual pivoting rule", Journal of Information & Optimization Sciences 15/3, 405-413.
17. Pan, P.-Q. (1994c), "Composite phase-1 methods without measuring infeasibility", in: M.-Y. Yue, ed., Theory of Optimization and its Applications, Xidian University Press, Xian, 359-364.
18. Pan, P.-Q. (1995), "New non-monotone procedures for achieving dual feasibility", Journal of Nanjing University, Mathematics Biquarterly 12/2, 155-162.
19. Pan, P.-Q. (1996), "A modified bisection simplex method for linear programming" Journal of Computational Mathematics 14/3, 249-255.