An exterior-point method for linear programming problems
From MaRDI portal
Publication:2564164
DOI10.1007/BF02190122zbMath0866.90086MaRDI QIDQ2564164
Jan Frederick Andrus, M. R. Schäferkotter
Publication date: 7 January 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (4)
Exterior point simplex-type algorithms for linear and network optimization problems ⋮ The sagitta method for solving linear programs ⋮ On using exterior penalty approaches for solving linear programming problems ⋮ A space decomposition-based deterministic algorithm for solving linear optimization problems
Cites Work
- Comparison of mathematical programming software: A case study using discrete \(L_ 1\) approximation codes
- 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
- Interior path following primal-dual algorithms. I: Linear programming
- An exterior point method for the convex programming problem
- Polynomial algorithms in linear programming
This page was built for publication: An exterior-point method for linear programming problems
