Data perturbation analyses for linear programming.

Titre: Data perturbation analyses for linear programming.
Auteur(s): Karamalis, Constantinos.
Date: 1994
Résumé: This thesis focuses on several aspects of data perturbation for Linear Programming. Classical questions of degeneracy and post-optimal analysis are given a unified presentation, in a view of new interior point methods of linear programming. The performance of these methods is compared to the simplex algorithm; interior point methods are shown to alleviate some difficulties of representation and solution of linear programs. An affine scaling algorithm is implemented in conjunction with a simple rounding heuristic to asses the benefit of interior point trajectories to provide approximate solutions of linear integer programming.
CollectionThèses, 1910 - 2010 // Theses, 1910 - 2010
MM00475.PDF2.93 MBAdobe PDFOuvrir