Publications

BibTex format

@article{Samaras:2009:10.2298/YJOR0901123S,
author = {Samaras, N and Sifelaras, A and Triantafyllidis, C},
doi = {10.2298/YJOR0901123S},
journal = {Yugoslav Journal of Operations Research},
pages = {123--132},
title = {A primal-dual exterior point algorithm for linear programming problems},
url = {http://dx.doi.org/10.2298/YJOR0901123S},
volume = {19},
year = {2009}
}

Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - The aim of this paper is to present a new simplex type algorithm for the Linear Programming Problem. The Primal - Dual method is a Simplex - type pivoting algorithm that generates two paths in order to converge to the optimal solution. The first path is primal feasible while the second one is dual feasible for the original problem. Specifically, we use a three-phase- implementation. The first two phases construct the required primal and dual feasible solutions, using the Primal Simplex algorithm. Finally, in the third phase the Primal - Dual algorithm is applied. Moreover, a computational study has been carried out, using randomly generated sparse optimal linear problems, to compare its computational efficiency with the Primal Simplex algorithm and also with MATLAB's Interior Point Method implementation. The algorithm appears to be very promising since it clearly shows its superiority to the Primal Simplex algorithm as well as its robustness over the IPM algorithm.
AU  - Samaras,N
AU  - Sifelaras,A
AU  - Triantafyllidis,C
DO  - 10.2298/YJOR0901123S
EP  - 132
PY  - 2009///
SN  - 0354-0243
SP  - 123
TI  - A primal-dual exterior point algorithm for linear programming problems
T2  - Yugoslav Journal of Operations Research
UR  - http://dx.doi.org/10.2298/YJOR0901123S
VL  - 19
ER  -

Download

Dr Charalampos (Harry) Triantafyllidis

Contact

Location

Summary

Citation

BibTex format

RIS format (EndNote, RefMan)