Academic Journal
A new non-monotonic infeasible simplex-type algorithm for Linear Programming
| العنوان: | A new non-monotonic infeasible simplex-type algorithm for Linear Programming |
|---|---|
| المؤلفون: | Triantafyllidis, Charalampos P., Samaras, Nikolaos |
| المصدر: | PeerJ Computer Science ; volume 6, page e265 ; ISSN 2376-5992 |
| بيانات النشر: | PeerJ |
| سنة النشر: | 2020 |
| المجموعة: | PeerJ (E-Journal - via CrossRef) |
| الوصف: | 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. |
| نوع الوثيقة: | article in journal/newspaper |
| اللغة: | English |
| DOI: | 10.7717/peerj-cs.265 |
| الاتاحة: | http://dx.doi.org/10.7717/peerj-cs.265 https://peerj.com/articles/cs-265.pdf https://peerj.com/articles/cs-265.xml https://peerj.com/articles/cs-265.html |
| Rights: | https://creativecommons.org/licenses/by/4.0/ |
| رقم الانضمام: | edsbas.BC8ECEED |
| قاعدة البيانات: | BASE |
| DOI: | 10.7717/peerj-cs.265 |
|---|