Data perturbation analyses for linear programming.

Data perturbation analyses for linear programming.

Détails

Titre: Data perturbation analyses for linear programming.
Auteur: Karamalis, Constantinos.
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.
Date: 1994
URI: http://hdl.handle.net/10393/6709

Fichier(s) constituant ce document :

Fichier(s) Taille Format
MM00475.PDF 3.003Mb application/pdf Voir/Ouvrir

Cet article est disponible dans les collections suivantes

Détails


Nos coordonnées

Pavillon Morisset (carte)
65, rue Université
Ottawa ON Canada
K1N 6N5

Tél. 613-562-5800 (4563)
Fax 613-562-5195

ruor@uottawa.ca