Extensions of the potential reduction algorithm for linear programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1047677
- scientific article; zbMATH DE number 4197744
- Potential-reduction methods in mathematical programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
Cites work
- scientific article; zbMATH DE number 3956307 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Centered Projective Algorithm for Linear Programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A polynomial-time algorithm, based on Newton's method, 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
- An interior point potential reduction algorithm for the linear complementarity problem
- Interior path following primal-dual algorithms. I: Linear programming
Cited in
(8)- A potential-reduction algorithm for linear complementarity problems
- Differential-algebraic approach to linear programming
- scientific article; zbMATH DE number 1866915 (Why is no real title available?)
- Potential function methods for approximately solving linear programming problems: theory and practice.
- scientific article; zbMATH DE number 724220 (Why is no real title available?)
- Robust reduction of a class of large-scale linear programs
- On lower bound updates in primal potential reduction methods for linear programming
- An external reconstruction approach (ERA) to linear programming
This page was built for publication: Extensions of the potential reduction algorithm for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336068)