A fully polynomial time projective method (Q1104857)

This paper proposes a fully polynomial time algorithm for the class of linear programming problems with rational input. The algorithm is obtained as a modification of the projective algorithm of \textit{G. de Ghellinck} and the author [Math. Program. 39, 79-92 (1987; Zbl 0636.90054)]. The algorithm utilizes round-off to bound the size of the numbers occuring in the calculations by a fixed bound which is polynomial in the size of the problem