A least-squares primal-dual algorithm for solving linear programming problems

DOI10.1016/S0167-6377(02)00163-3zbMath1010.90044OpenAlexW2077583960MaRDI QIDQ1866990

Balaji Gopalakrishnan, Ellis L. Johnson, Earl R. Barnes, Victoria C. P. Chen

Publication date: 2 April 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00163-3

zbMATH Keywords

linear programmingleast squaresdegeneracyprimal-dual

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items

BoxStep methods for crew pairing problems, Mathematical programming via the least-squares method, ON SOLVING SHORTEST PATHS WITH A LEAST-SQUARES PRIMAL-DUAL ALGORITHM, A least-squares minimum-cost network flow algorithm, A dual ascent procedure for the set partitioning problem, Dual–primal algorithm for linear optimization, An interesting characteristic of phase-1 of dual–primal algorithm for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A least-squares minimum-cost network flow algorithm
• A strictly improving linear programming Phase I algorithm
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems