A Revised Dual Projective Pivot Algorithm for Linear Programming
From MaRDI portal
Publication:5317549
DOI10.1137/030602253zbMath1093.65062OpenAlexW2019319378MaRDI QIDQ5317549
Publication date: 16 September 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/030602253
numerical examplesLU factorizationdual algorithmdeficient basislarge-scale linear programmingpreudobasisprojective pivot algorithms
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)
Related Items
A linear programming decomposition focusing on the span of the nondegenerate columns, The positive edge pricing rule for the dual simplex, Improving a primal–dual simplex-type algorithm using interior point methods, Book review of: P.-Q. Pan, Linear programming computation, A primal deficient-basis simplex algorithm for linear programming, A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming, An affine-scaling pivot algorithm for linear programming
Uses Software