Solving linear feasibility in linear number of steps.
Résumé
This paper introduces an algorithms for linear feasibility which is deterministic, exact, and, with a linear complexity (in step - each step corresponding to solve a linear system).
In addition, this algorithm has several features which should be explored. First, both the numbers of steps with high or low Newton increment are negligible. Then, this algorithm does not seem to be related to central path when extended to linear programming.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)