The simplest polynomial times algorithm for linear programming.
Résumé
This paper introduces a simple and straightforward algorithm for linear programming.
Only self concordant theory and basic linear algebra are required to prove the convergence and the polynomial times complexity.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...