A fully polynomial time projective method (Q1104857)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fully polynomial time projective method |
scientific article; zbMATH DE number 4057280
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial time projective method |
scientific article; zbMATH DE number 4057280 |
Statements
A fully polynomial time projective method (English)
0 references
1988
0 references
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
0 references
fully polynomial time algorithm
0 references
rational input
0 references
projective algorithm
0 references
fixed bound
0 references
0 references
0 references
