TY - JOUR UR - https://doi.org/10.7717/peerj-cs.265 DO - 10.7717/peerj-cs.265 TI - A new non-monotonic infeasible simplex-type algorithm for Linear Programming AU - Triantafyllidis,Charalampos P. AU - Samaras,Nikolaos A2 - Szénási,Sándor DA - 2020/03/30 PY - 2020 KW - Linear programming KW - Simplex-type KW - Interior point method KW - Exterior point KW - Non-monotonic KW - Infeasible KW - Mathematical programming KW - Optimization 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. VL - 6 SP - e265 T2 - PeerJ Computer Science JO - PeerJ Computer Science J2 - PeerJ Computer Science SN - 2376-5992 ER -