Cargando…
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...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
PeerJ Inc.
2020
|
| Materias: | |
| 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 |