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

DOI10.1023/A:1015356704142zbMath1015.90052OpenAlexW1498801564MaRDI QIDQ700716

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 programmingsimplex methodaugmented Lagrangian methodmultiplier method

Mathematics Subject Classification ID

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

Cites Work

• A new polynomial-time algorithm for linear programming
• A practicable steepest-edge simplex algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

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