A projective simplex method for linear programming

DOI10.1016/S0024-3795(99)00010-5zbMATH Open0961.90061OpenAlexW2086095490WikidataQ114850251 ScholiaQ114850251MaRDI QIDQ1124875FDOQ1124875

Authors 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 problemQR factorizationsimplex methodcrash heuristic

Mathematics Subject Classification ID

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

Recommendations

• A dual projective simplex method for linear programming
• A dual projective pivot algorithm for linear programming
• A projective simplex algorithm using LU decomposition
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• Karmarkar's projective method for linear programming: a computational survey

Cited in

(19)

• Efficient nested pricing in the simplex algorithm
• A projective simplex algorithm using LU decomposition
• A phase-1 approach for the generalized simplex algorithm
• A Revised Dual Projective Pivot Algorithm for Linear Programming
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• A dual projective pivot algorithm for linear programming
• scientific article; zbMATH DE number 4025156 (Why is no real title available?)
• Partial pricing rule simplex method with deficient basis
• Linear updates for a single-phase projective method
• A primal deficient-basis simplex algorithm for linear programming
• A combined phase I-phase II projective algorithm for linear programming
• A new least square algorithm for linear programming
• scientific article; zbMATH DE number 6613080 (Why is no real title available?)
• scientific article; zbMATH DE number 4119925 (Why is no real title available?)
• Combined projected gradient 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
• The `Idiot' crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems
• An experimental approach to karmarkar’s projective method for linear programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124875)