A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm†

DOI10.1080/10556780902752785zbMath1160.90576OpenAlexW2171614919MaRDI QIDQ3620911

Ángel Santos-Palomo, Pablo Guerrero-García

Publication date: 14 April 2009

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780902752785

zbMATH Keywords

linear programmingsparse Cholesky factorizationdeficient-basis simplex-type method

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Linear programming (90C05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

A two-phase support method for solving linear programs: numerical experiments ⋮ Exterior point simplex-type algorithms for linear and network optimization problems

This page was built for publication: A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm†