A fully polynomial time projective method

DOI10.1016/0167-6377(88)90046-6zbMath0647.90057OpenAlexW2119824688MaRDI QIDQ1104857

Jean-Philippe Vial

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90046-6

zbMATH Keywords

projective algorithmfixed boundfully polynomial time algorithmrational input

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• A new polynomial-time algorithm for linear programming
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
• Khachiyan's linear programming algorithm
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• Systems of distinct representatives and linear algebra

This page was built for publication: A fully polynomial time projective method