A fully polynomial time projective method

Authors:
Jean-Philippe Vial
Affiliations:
Département d'Economie Commerciale et Industrielle, Université de Genève, 2 rue de Candolle, CH 1211, Genève 4, Switzerland and CORE, Université Catholique de Louvain, Pla ...
Venue:
Operations Research Letters
Year:
1988

Citing 3
Cited 1

A new polynomial-time algorithm for linear programming

Combinatorica
A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research
An extension of Karmarkar`s algorithm for solving a system of linear homogeneousequations on the simplex

Mathematical Programming: Series A and B

Generalization of Karmarkar's algorithm to convex homogeneous functions

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a modification of the algorithm of de Ghellinck and Vial, which keeps the size of the numbers occurring in the calculation by a fixed bound, independently of the number of iterations. This algorithm is fully polynomial in time.