Extensions of the potential reduction algorithm for linear programming
From MaRDI portal
Publication:1336068
DOI10.1007/BF00939838zbMath0807.90085MaRDI QIDQ1336068
Publication date: 1 November 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
potential functionsprimal and dual problemspotential reduction algorithmanalytic center of a polytopezero-sum bimatrix game
Related Items (1)
Cites Work
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An interior point potential reduction algorithm for the linear complementarity problem
- A Centered Projective Algorithm for Linear Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Extensions of the potential reduction algorithm for linear programming
