A direct ellipsoid method for linear programming

DOI10.1017/S0004972700012272MaRDI QIDQ4287866zbMATH OpenFDO

Authors Shiquan Wu, Fang Wu

Publication date 19 April 1994

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972700012272

zbMATH Keywords

ellipsoid methodKarmarkar's method

Mathematics Subject Classification ID

Linear programming (90C05)

Cites work

• A new polynomial-time algorithm for linear programming
• Convergence Rates of the Ellipsoid Method on General Convex Functions
• Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
• Karmarkar's algorithm and the ellipsoid method
• On the Solution of Variational Inequalities by the Ellipsoid Method

Cited in

(11)

• scientific article; zbMATH DE number 3858834 (Why is no real title available?)
• Application of the ellipsoid method in an interactive procedure for multicriteria linear programming
• scientific article; zbMATH DE number 3869057 (Why is no real title available?)
• scientific article; zbMATH DE number 3876916 (Why is no real title available?)
• scientific article; zbMATH DE number 4003907 (Why is no real title available?)
• scientific article; zbMATH DE number 4060993 (Why is no real title available?)
• scientific article; zbMATH DE number 1150370 (Why is no real title available?)
• scientific article; zbMATH DE number 279596 (Why is no real title available?)
• scientific article; zbMATH DE number 5585899 (Why is no real title available?)
• Interior point algorithm for linear programming problem and related inscribed ellipsoids
• A subgradient supported ellipsoid method for convex multiobjective optimization problems

This page was built for publication: A direct ellipsoid method for linear programming

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