A projective simplex method for linear programming

DOI10.1016/S0024-3795(99)00010-5zbMath0961.90061OpenAlexW2086095490WikidataQ114850251 ScholiaQ114850251MaRDI QIDQ1124875

Ping-Qi Pan

Publication date: 29 November 1999

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0024-3795(99)00010-5

zbMATH Keywords

linear programmingleast squares problemsimplex methodQR factorizationcrash heuristic

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A phase-1 approach for the generalized simplex algorithm ⋮ A projective simplex algorithm using LU decomposition ⋮ Efficient nested pricing in the simplex algorithm ⋮ A primal deficient-basis simplex algorithm for linear programming ⋮ A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming ⋮ A new least square algorithm for linear programming ⋮ Combined projected gradient algorithm for linear programming ⋮ An affine-scaling pivot algorithm for linear programming

This page was built for publication: A projective simplex method for linear programming