A dual projective simplex method for linear programming

Computers and Mathematics with Applications

Volumn 35, Issue 6, 1998, Pages 119-135

  Pan, Ping Qi ^a  

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

Dual heuristic; Dual method; Least squares problem; Linear programming; Orthogonalization

Indexed keywords

HEURISTIC METHODS; LEAST SQUARES APPROXIMATIONS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

DUAL HEURISTIC; DUAL SIMPLEX METHOD; PROJECTIVE SIMPLEX METHOD;

LINEAR PROGRAMMING;

EID: 0032020279     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(98)00024-8     Document Type: Article

References (30)

1. P.-Q. Pan, A projective simplex method for linear programming (to appear).
2. E.M.L. Beale, An alternative method for linear programming, In Proceedings of Cambridge Philosophical Society, Volume 50, pp. 513-523, (1954).
3. G.B. Dantzig, The Dual Simplex Algorithm, RAND Report RM-1270, The RAND Corporation, Santa Monica, CA, (1954).
4. C.E. Lemke, The dual method of solving the linear programming problem, Naval Research Logistics Quarterly 1, 36-47, (1954).
5. J.J.H. Forrest and D. Goldfarb, Steepest-edge simplex algorithms for linear programming, Mathematical Programming 57, 341-374, (1992).
6. G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, (1983).
7. P.M.J. Harris, Pivot selection methods of the Devex LP code, Mathematical Programming 5, 1-28, (1973).
8. P.-Q. Pan, Practical finite pivoting rules for the simplex method, OR Spektrum 12, 219-225, (1990).
9. P.-Q. Pan, A simplex-like method with bisection for linear programming, Optimization 22 (5), 717-743, (1991).
10. G.W. Stewart, The economical storage of plane rotations, Numer. Math. 25, 137-138, (1976).
11. D.M. Gay, Electronic mail distribution of linear programming test problems, Mathematical Programming Society COAL Newsletter 13, 10-12, (1985).
12. P.-Q. Pan, Ratio-test-free pivoting rules for a dual Phase-1 method, In Proceedings of the Third Conference of Chinese SIAM, (Edited by S.-T Xiao and F. Wu), pp. 245-249, Tsinghua University Press, Beijing, (1994).
13. P.-Q. Pan, Achieving primal feasibility under the dual pivoting rule, Journal of Information & Optimization Sciences 15 (3), 405-413, (1994).
14. P.-Q. Pan, New non-monotone procedures for achieving dual feasibility, Journal of Nanjing University, Mathematics Biquarterly 12 (2), 155-162, (1995).
15. P.-Q. Pan, A modified bisection simplex method for linear programming, Journal of Computational Mathematics 14 (3), 249-255, (1996).
16. P.-Q. Pan, The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study, European Journal of Operations Research 101 (1), (August 1997).
17. V. Chvatal, Linear Programming, Freeman and Company, San Francisco, CA, (1983).
18. J. Daniel, W.B. Gragg, L. Kaufman and G.W. Stewart, Reothogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp. 30, 772-795, (1976).
19. G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, (1963).
20. S.-C. Fang and S. Puthenpura, Linear Optimization and Extensions: Theory and Algorithms, Prentice Hall, (1993).
21. S.I. Gass, Linear Programming: Methods and Applications, Fifth edition, McGraw-Hill, New York, (1985).
22. P.E. Gill, G.H. Golub, W. Murray and M.A. Saunders, Methods for modifying matrix factorization, Math. Comp. 28, 505-538, (1974).
23. P.E. Gill, W. Murray and M.A. Saunders, Methods for computing and modifying the LDV factors of a matrix, Math. Comp. 29, 1051-1077, (1975).
24. W. Givens, Computation of plane unitary rotations transforming a general matrix to triangular form, SIAM J. App. Math. 6, 26-50, (1958).
25. D. Goldfarb, Factorized variable metric methods for unconstrained optimization, Math. Comp. 30, 796-811, (1976).
26. D. Goldfarb and M.J. Todd, Linear programming, in optimization, In Handbook in Operations Research and Management Science, Volume 1, (Edited by G.L. Nemhauser and A.H.G. Rinnooy Kan), pp. 73-170, (1989).
27. G.H. Golub, Numerical methods for solving linear least squares problems, Numer. Math. 7, 206-216, (1965).
28. H.-J. Greenberg, Pivot selection tactics, In Design and Implementation of Optimization Software, (Edited by H.J. Greenberg, Sijthoff and Noordhoff), pp. 109-143, (1978).
29. S. Hammarling, A note on modifications to the Givens plane rotation, J. Inst. Math. Appl. 13, 215-218, (1974).
30. A. Schrijver, The Theory of Linear and Integer Programming, John Wiley & Sons, Chichester, (1986).