Simplices by point-sliding and the Yamnitsky-Levin algorithm

DOI10.1007/BF01199467MaRDI QIDQ1366323zbMATH OpenOpenAlexFDO

Authors Bernhard Rupp, U. Faigle, Marcel Hunting, Walter Kern, Rajat Prakash, Kenneth J. Supowit

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, https://ris.utwente.nl/ws/files/6633329/Faigle97simplices.pdf

zbMATH Keywords

ellopsoid methodsimplexsystems of linear inequalitiestesting feasibility

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 1538128
• scientific article; zbMATH DE number 3945871
• scientific article; zbMATH DE number 3970513
• A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension

Cites work

• A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• Feature Article—The Ellipsoid Method: A Survey
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3876916 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3758079 (Why is no real title available?)
• Khachiyan’s algorithm for linear programming
• Modifications and implementation of the ellipsoid algorithm for linear programming

Cited in

(2)

• scientific article; zbMATH DE number 3945871 (Why is no real title available?)
• scientific article; zbMATH DE number 1538128 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366323)