Simplices by point-sliding and the Yamnitsky-Levin algorithm

DOI10.1007/BF01199467zbMath0886.90101OpenAlexW2019626226MaRDI QIDQ1366323

Bernhard Rupp

Publication date: 10 September 1997

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01199467

zbMATH Keywords

simplexsystems of linear inequalitiesellopsoid methodtesting feasibility

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• Khachiyan’s algorithm for linear programming
• Feature Article—The Ellipsoid Method: A Survey
• Modifications and implementation of the ellipsoid algorithm for linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simplices by point-sliding and the Yamnitsky-Levin algorithm