A new least square algorithm for linear programming

DOI10.1007/BF02791347zbMath1142.90019OpenAlexW2078207990MaRDI QIDQ2505271

Wei Li, Guangting Chen

Publication date: 4 October 2006

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02791347

zbMATH Keywords

interior-point methodQR decompositionpivot method

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (1)

Existence and iterative construction of solutions to non-linear Dirichlet boundary value problems with p-Laplacian operator

Cites Work

• A projective simplex method for linear programming
• Pivot versus interior point methods: Pros and cons
• Steepest-edge simplex algorithms for linear programming
• A note on two direct methods in linear programming
• Combining Interior-Point and Pivoting Algorithms for Linear Programming

This page was built for publication: A new least square algorithm for linear programming