A simple complexity proof for a polynomial-time linear programming algorithm
From MaRDI portal
Publication:1824548
DOI10.1016/0167-6377(89)90042-4zbMath0682.90059OpenAlexW2041934365MaRDI QIDQ1824548
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90042-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Interior dual proximal point algorithm for linear programs ⋮ An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time 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
- Enlarging the region of convergence of Newton's method for constrained optimization
- Generation of degenerate linear programming problems
- Gaussian elimination is not optimal
This page was built for publication: A simple complexity proof for a polynomial-time linear programming algorithm
