A new non-monotonic infeasible simplex-type algorithm for Linear Programming

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 se...

Descripción completa

Detalles Bibliográficos
Autores principales: Triantafyllidis, Charalampos P., Samaras, Nikolaos
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2020
Materias:
Algorithms and Analysis of Algorithms
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7924451/
https://www.ncbi.nlm.nih.gov/pubmed/33816916
http://dx.doi.org/10.7717/peerj-cs.265

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7924451/
https://www.ncbi.nlm.nih.gov/pubmed/33816916
http://dx.doi.org/10.7717/peerj-cs.265

Ejemplares similares