Numerical aspects in developing LP softwares, LPAKO and LPABO

DOI10.1016/S0377-0427(02)00707-0zbMath1018.65075MaRDI QIDQ1872947

Soondal Park, Seung-yong Doh, Sungmook Lim, Jaegeun Ahn, Woo-je Kim

Publication date: 19 May 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

orderinglinear programmingscalinginterior point methodLU factorizationsimplex methodpresolvingtolerancesLPABOLPAKO

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Packaged methods for numerical algorithms (65Y15)

Related Items (1)

ON THE PROPERTIES OF ∊-SENSITIVITY ANALYSIS FOR LINEAR PROGRAMMING

Uses Software

• LPABO
• LPAKO
• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• A practical anti-cycling procedure for linearly constrained optimization
• A fast LU update for linear programming
• Pivot rules for linear programming: A survey on recent theoretical developments
• Steepest-edge simplex algorithms for linear programming
• Multiple centrality corrections in a primal-dual method for linear programming
• Presolving in linear programming
• The Role of Elimination Trees in Sparse Factorization
• On the Implementation of a Primal-Dual Interior Point Method
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• Splitting dense columns of constraint matrix in interior point methods for large scale linear programming¹¹The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef:²²A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-…
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• The simplex method of linear programming using LU decomposition
• Pivot selection methods of the Devex LP code

This page was built for publication: Numerical aspects in developing LP softwares, LPAKO and LPABO