On the equivalence of the simplex methods and a multiplier-alike method for linear programming

DOI10.1023/A:1015356704142zbMATH Open1015.90052OpenAlexW1498801564MaRDI QIDQ700716FDOQ700716

Authors D. Kharzeev

Publication date 8 October 2002

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1015356704142

zbMATH Keywords

linear programmingaugmented Lagrangian methodsimplex methodmultiplier method

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• On the development of simplex methods for linear multiplier-alike method
• An interior point method for linear programming
• scientific article; zbMATH DE number 1150439
• A multiplicative barrier function method for linear programming
• A unified view of interior point methods for linear programming

Cites work

• scientific article; zbMATH DE number 3844489 (Why is no real title available?)
• scientific article; zbMATH DE number 3912096 (Why is no real title available?)
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A practicable steepest-edge simplex algorithm

Cited in

(1)

• On the development of simplex methods for linear multiplier-alike method

This page was built for publication: On the equivalence of the simplex methods and a multiplier-alike method for linear programming

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