Walking on the vertices of a polytope.
Résumé
This paper presents an algorithm for linear programming.
This algorithm is clearly exponential.
But, this algorithm has the interesting features of being strongly polynomial for a given number of vertices/support sets.
Precisely, the number of operation required to solve an instance is linear in the total number of vertices/support sets with a strongly polynomial factor.
This feature is not shared by simplex, because, simplex may be locked into degenerated vertices contrary to the offered algorithm.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...