Thizy, Jean-Michel,Karamalis, Constantinos.2009-03-232009-03-2319941994Source: Masters Abstracts International, Volume: 34-02, page: 0872.9780612004757http://hdl.handle.net/10393/6709http://dx.doi.org/10.20381/ruor-14975This 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.198 p.Engineering, System Science.Thesis