A primal-dual exterior point algorithm for linear programming problems

Yugoslav Journal of Operations Research

Volumn 19, Issue 1, 2009, Pages 123-132

  Samaras, Nikolaos ^a   Sifelaras, Angelo ^a   Triantafyllidis, Charalampos ^a  

^a UNIVERSITY OF MACEDONIA   (Greece)

Author keywords

Computational study; Linear optimization; Primal dual exterior point algorithm; Simplex type algorithms

Indexed keywords

EID: 78650883313     PISSN: 03540243     EISSN: 23346043     Source Type: Journal    
DOI: 10.2298/YJOR0901123S     Document Type: Article

References (10)

1. Bazaraa, M.S., Jarvis, J.J., and Sherali H.D., Linear Programming and Network Flows, 3rd ed., John Wiley & Sons, 2005.
2. Bertsimas, D., and Tsitsiklis, J.N., Introduction to Linear Optimization, Athena Scientific, 1997.
3. Bland, G.R., "New finite pivoting rules for the Simplex method", Mathematics of Operations Research, 2 (1977) 103-107.
4. Dantzig, G.B., Linear Programming and Extensions, Princeton, University Press, Princeton, NJ, 1963.
5. Erling, D. Andersen., and Yinyu, Ye, "Combining interior-point and pivoting algorithms for Linear Programming", Management Science, 42 (12) (1996) 1719-1731.
6. Gondzio, J., "Multiple centrality corrections in a primal-dual method for linear programming", Computational Optimization and Applications, 6 (2) (1996) 137-156.
7. Paparrizos, K., Samaras, N., and Stephanides, G., "A new efficient primal dual simplex algorithm", Computers and Operations Research, 30 (2003) 1383-1399.
8. Paparrizos, K., "Pivoting algorithms generating two paths", presented in ISMP '97, Lausanne, EPFL Switzerland, 1997.
9. Samaras, N., "Computational improvements and efficient implementation of two path pivoting algorithms", PhD Thesis, Department of Applied Informatics, University of Macedonia, 2001.
10. Triantafyllidis, Ch., "Comparative computational study on Exterior Point Algorithms", BSc Thesis, Department of Applied Informatics, University of Macedonia, 2005.