Article ID Journal Published Year Pages File Type
7543799 Operations Research Letters 2018 10 Pages PDF
Abstract
In this paper, we are interested in the performance of Karmarkar's projective algorithm for linear programming. We propose a new displacement step to accelerate and improve the convergence of this algorithm. This purpose is confirmed by numerical experimentations showing the efficiency and the robustness of the obtained algorithm over Schrijver's one for small problem dimensions.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A new efficient short-step projective interior point method for linear programming
Authors
, , ,