scientific article; zbMATH DE number 1131729

MaRDI QIDQ4382745zbMATH OpenFDO

Authors Xin-Ming Lu, Maoxian Zhao, Ziyou Gao

Publication date 12 May 1998

zbMATH Keywords

complexityellipsoid algorithmnumerical experimentspivoting methodpolynomial algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 279596
• scientific article; zbMATH DE number 3858834
• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 4016589

Cited in

(5)

• scientific article; zbMATH DE number 3858835 (Why is no real title available?)
• scientific article; zbMATH DE number 5018767 (Why is no real title available?)
• scientific article; zbMATH DE number 279596 (Why is no real title available?)
• On an efficient implementation of the face algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations

This page was built for publication:

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