A polynomial-time log barrier algorithm for linear programming with simplex-like features.
Résumé
This paper presents a polynomial-times log barrier algorithm which solves linear programming which has some simplex-like features.
As simple log barrier, this algorithm is probably less efficient than central path log barrier but still polynomial times.
But, it is suitable for hybridization.
Origine : Fichiers produits par l'(les) auteur(s)