A basis-deficiency-allowing variation of the simplex method for linear programming

Computers and Mathematics with Applications

Volumn 36, Issue 3, 1998, Pages 33-53

  Pan, P Q ^a  

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

Basis deficiency; Degeneracy; Least squares problem; Linear programming; Orthogonal transformation; Simplex method

Indexed keywords

COMPUTATIONAL METHODS; MATRIX ALGEBRA; POLES AND ZEROS; PROBLEM SOLVING;

BASIS DEFICIENCY; DEGENERACY; ORTHOGONAL TRANSFORMATION; SIMPLEX METHOD;

LINEAR PROGRAMMING;

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

References (36)

1. G.B. Dantzig, Programming in a linear structure, Comptroller, USAF, Washington, D.C., (February 1948).
2. G.B. Dantzig, Programming of interdependent activities, II, Mathematical model, In Activity Analysis of Production and Allocation, (Edited by T.C. Koopmans), pp. 19-32, John Wiley & Sons, New York, (1951); Ecomometrica, 17, (3,4), 200-211, (1949).
3. G.B. Dantzig, Programming of interdependent activities, II, Mathematical model, In Activity Analysis of Production and Allocation, (Edited by T.C. Koopmans), pp. 19-32, John Wiley & Sons, New York, (1951); Ecomometrica, 17, (3,4), 200-211, (1949).
4. A.J. Hoffman, Cycling in the simplex algorithm, Report No. 2974, Nat. Bur. Standards, Washington, D.C., (1953).
5. E.M.L. Beale, Cycling in the dual simplex algorithm, Naval Research Logistics Quarterly 2, 269-275, (1955).
6. A. Charnes, Optimality and degeneracy in linear programming, Econometrica 20, 160-170, (1952).
7. G.B. Dantzig, A. Orden and P. Wolfe, The generalized simplex method for minimizing a linear form under linear inequality restraints, Pacific Journal of Mathematics 5, 183-195, (1955).
8. R.G. Bland, New finite pivoting rules for the simplex method, Mathematics of Operations Research 2, 103-107, (1977).
9. P.M.J. Harris, Pivot selection methods of the Devex LP code, Mathematical Programming Study 4, 30-57, (1975).
10. M. Benichou, J.M. Gauthier, G. Hentges and G. Ribiere, The efficient solution of linear programming problems - Some algorithmic techniques and computational results, Mathematical Programming 18, 280-322, (1977).
11. Scicon, Sciconic/VM User Guide, Version 1.40, Scicon Limited, Milton Keynes, (1986).
12. B. Hattersley and J. Wilson, A dual approach to primal degeneracy, Mathematical Programming 42, 135-145, (1988).
13. P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, A practical anti-cycling procedure for linearly constrained optimization, Mathematical Programming 45, 437-474, (1989).
14. P.-Q. Pan, Practical finite pivoting rules for the simplex method, Spektrum 1, 219-225, (1990).
15. P.-Q. Pan, A dual protective simplex method for linear programming, Computers Math. Applic. 35 (6), 119-135, (1998).
16. J.J.H. Forrest and D. Goldfarb, Steepest-edge simplex algorithms for linear programming, Mathematical Programming 57, 341-374, (1992).
17. D.M. Gay, Electronic mail distribution of linear programming test problems, Mathematical Programming Society COAL Newsletter 13, 10-12, (1985).
18. M. Bazaraa and J.J. Jarvis, Linear Programming and Network Flows, John Wiley & Sons, New York, (1977).
19. V. Chvatal, Linear Programming, Freeman and Company, San Francisco, CA, (1983).
20. G.B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, NJ, (1963).
21. S.-C. Fang and S. Puthenpura, Linear Optimization and Extensions: Theory and Algorithms, Prentice Hall, (1993).
22. S.I. Gass, Linear Programming: Methods and Applications, Fifth edition, McGraw-Hill, New York, (1985).
23. D. Goldfarb and J.K. Reid, A practicable steepest-edge simplex algorithm, Mathematical Programming 12, 361-371, (1977).
24. D. Goldfarb and M. J. Todd, Linear programming, in optimization, In Handbook in Operations Research and Management Science, (Edited by G.L. Nemhauser and A.H.G. Rinnooy Kan), Volume 1, pp. 73-170, (1989).
25. G.H. Golub and C.F. Van Loan, Matrix Computations, John Hopkins University Press, Baltimore, MD, (1983).
26. 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).
27. D. Luemberger, Introduction to Linear and Nonlinear Programming, Addison-Wesley, Reading, MA, (1973).
28. K. Murty, Linear and Combinatorial Programming, John Wiley & Sons, New York, (1976).
29. W. Orchard-Hayes, Background development and extensions of the revised simplex method, Rand Report RM 1433, The Rand Corporation, Santa Monica, CA, (1954).
30. P.-Q. Pan, A simplex-like method with bisection for linear programming, Optimization 5, 717-743, (1991).
31. 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, (1994a).
32. P.-Q. Pan, Achieving primal feasibility under the dual pivoting rule, Journal of Information & Optimization Sciences 15 (3), 405-413, (1994b).
33. P.-Q. Pan, Composite phase-1 methods without measuring infeasibility, In Theory of Optimization and its Applications, (Edited by M.-Y. Yue), pp. 359-364, Xidian University Press, Xian, (1994c).
34. P.-Q. Pan, New non-monotone procedures for achieving dual feasibility, Journal of Nanjing University, Mathematics Biquarterly 12 (2), 155-162, (1995).
35. P.-Q. Pan, A modified bisection simplex method for linear programming, Journal of Computational Mathematics 14 (3), 249-255, (1996).
36. P.-Q. Pan, The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study, European Journal of Operations Research 101 (1), 167-176, (1997).