A new efficient primal dual simplex algorithm

Computers and Operations Research

Volumn 30, Issue 9, 2003, Pages 1383-1399

  Paparrizos, Konstantinos ^a   Samaras, Nikolaos ^a   Stephanides, George ^a  

^a UNIVERSITY OF MACEDONIA   (Greece)

Author keywords

Exterior point of algorithm; Linear programming; Numerical results; Two path algorithms

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING;

PRIMAL DUAL SIMPLEX ALGORITHMS;

OPERATIONS RESEARCH;

ALGORITHM;

EID: 0037411891     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00077-1     Document Type: Article

References (21)

1. Borgwardt HK. Some distribution-independent results about the asymptotic order of the average number of pivot steps of the simplex algorithm. Mathematics of Operations Research 1982;7(3):441-62.
2. Borgwardt HK. The average number of pivot steps required by the simplex method is polynomial. Zeitschrift fur Operational Research, Series A: Theory 1982;26(5):157-77.
3. Klee V, Minty GJ. How good is the simplex algorithm? In: Shisha O, editor. Inequalities III. New York: Academic Press; 158-72.
4. Gondzio J. Multiple centrality corrections in a primal-dual method for linear programming. Computational Optimization and Applications 1996;6:137-56.
5. Gondzio J. Splitting dense columns of constraint matrix in interior point methods for large-scale linear programming. Optimization 1992;24:285-97.
6. Karmarkar NK. A polynomial-time algorithm for linear programming. Combinatorica 1984;4:373-95.
7. Lustig JI, Marstenand RE, Shanno DF. On implementing Mehrotra's predictor-corrector interior point method for linear programming. SIAM Journal on Optimization 1992;2(3):435-49.
8. Paparrizos K. An infeasible exterior point simplex algorithm for assignment problems. Mathematical Programming 1991;51:45-54.
9. Paparrizos K. An exterior point simplex algorithm for general linear problems. Annals of Operation Research 1993;32:497-508.
10. Paparrizos K. A new primal and dual pivoting rule for the simplex algorithm. Proceedings of SYMOPIS '96 1996;1:445-53.
11. Paparrizos K. Pivoting algorithms generating two paths. Presented in ISMP '97, Lausanne, EPFL Switzerland 1997, Abstracts: 207.
12. Paparrizos K, Samaras N, Stephanides G. An efficient simplex type algorithm for sparse and dense linear programs. European Journal of Operations Research 2000, in press.
13. Anstreicher G, Terlaky T. A monotonic build-up simplex algorithm for linear programming. Operation Research 1994;42:556-61.
14. Chen H, Pardalos P, Saunders M. The simplex algorithm with a new primal and dual pivot rule. Operations Research Letters 1994;16:121-7.
15. Curet N. A primal-dual simplex method for linear problems. Operations Research Letters 1974;16:233-7.
16. Murty KG, Fathi Y. A feasible direction method for linear programming. Operations Research Letters 1984;3(3):121-7.
17. Terlaky T, Zhang S. Pivot rules for linear programming-A survey. Annals of Operations Research 1993;46:203-33.
18. Andersen ED, Ye Y. Combining interior-point and pivoting algorithms for linear programming. Management Science 1996;42(12):1719-31.
19. Megiddo N. On finding primal and dual optimal bases. ORSA Journal on Computing 1991;3(1):63-5.
20. Dosios K, Paparrizos K. Resolution of the problem of degeneracy in a primal and dual simplex algorithm. Operations Research Letters 1997;20:45-50.
21. Samaras N. Computational improvements and efficient implementation of two path pivoting algorithms. Ph.D. thesis, University of Macedonia, Department of Applied Informatics, June 2001.