Binary complexity in linear programming.
Résumé
Naive Gaussian elimination is known to be exponential when done with arbitrary large integer representation. This highlights that binary properties of algorithms are (at least theoretically) important.
Yet, state of the art of linear programming only weakly tackles this issue.
Indeed, this paper stresses some difficulties which can arise when solving linear programming with classical methods under arbitrary large integer representation setting.
Then, it introduces a new polynomial times algorithm for linear programming with better binary properties.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)