A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
Year of publication: |
November 2017
|
---|---|
Authors: | Ferrer, A. ; Goberna, M. A. ; González-Gutiérrez, E. ; Todorov, M. I. |
Published in: |
Annals of operations research ; volume 258, number 2 (November 2017). - New York, NY, USA : Springer. - 2017, p. 587-612
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A review of methods and algorithms for optimizing construction scheduling
Zhou, J., (2013)
-
A polyhedral description of kernels
Chen, Qin, (2016)
-
Computing integral solutions of complementarity problems
Laan, Gerard van der, (2004)
- More ...
-
On stable uniqueness in linear semi-infinite optimization
Goberna, M. A., (2012)
-
Sensitivity analysis in linear semi-infinite programming via partitions
Goberna, M. A., (2010)
-
Relaxation methods for solving linear inequality systems: converging results
González-Gutiérrez, E., (2012)
- More ...