Could interior point algorithm for linear programming can be helped by greedy improvement ?
Résumé
The structure of main polynomial time algorithms for linear program forbid them to use greedy improvement which could allow to stick to the combinatorial structure of the problem.
This paper reviews interior point for linear feasibility, and, wonder if a direct optimization could be feasible.
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...