A direct ellipsoid method for linear programming
From MaRDI portal
Publication:4287866
DOI10.1017/S0004972700012272zbMath0803.90091MaRDI QIDQ4287866
Publication date: 19 April 1994
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Cites Work
- A new polynomial-time algorithm for linear programming
- Karmarkar's algorithm and the ellipsoid method
- On the Solution of Variational Inequalities by the Ellipsoid Method
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- Convergence Rates of the Ellipsoid Method on General Convex Functions
This page was built for publication: A direct ellipsoid method for linear programming
