Imperial College London
Portrait Picture

Dr Charalampos (Harry) Triantafyllidis

Faculty of Medicine, School of Public Health

Honorary Research Associate
 
 
 
//

Contact

 

c.triantafyllidis CV

 
 
//

Location

 

16 South Wharf RoadSt Mary's Campus

//

Summary

 

Publications

Citation

BibTex format

@article{Triantafyllidis:2020:10.7717/peerj-cs.265,
author = {Triantafyllidis, CP and Samaras, N},
doi = {10.7717/peerj-cs.265},
journal = {PeerJ Computer Science},
title = {A new non-monotonic infeasible simplex-type algorithm for Linear Programming},
url = {http://dx.doi.org/10.7717/peerj-cs.265},
volume = {6},
year = {2020}
}
Download

RIS format (EndNote, RefMan)

TY  - JOUR
AB  - This paper presents a new simplex-type algorithm for Linear Programming with the following two main characteristics: (i) the algorithm computes basic solutions which are neither primal or dual feasible, nor monotonically improving and (ii) the sequence of these basic solutions is connected with a sequence of monotonically improving interior points to construct a feasible direction at each iteration. We compare the proposed algorithm with the state-of-the-art commercial CPLEX and Gurobi Primal-Simplex optimizers on a collection of 93 well known benchmarks. The results are promising, showing that the new algorithm competes versus the state-of-the-art solvers in the total number of iterations required to converge.
AU  - Triantafyllidis,CP
AU  - Samaras,N
DO  - 10.7717/peerj-cs.265
PY  - 2020///
SN  - 2376-5992
TI  - A new non-monotonic infeasible simplex-type algorithm for Linear Programming
T2  - PeerJ Computer Science
UR  - http://dx.doi.org/10.7717/peerj-cs.265
UR  - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000525828300001&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
UR  - https://peerj.com/articles/cs-265/
UR  - http://hdl.handle.net/10044/1/106641
VL  - 6
ER  -
Download