A simplex method algorithm using a double basis

DOI10.1134/S1995423915040011MaRDI QIDQ5741301zbMATHOpenAlexFDO

Authors G. I. Zabinyako

Publication date 22 July 2016

Published in Numerical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995423915040011

zbMATH Keywords

linear programmingsparse matrixsimplex methodLU decompositiondecomposition updating

Mathematics Subject Classification ID

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

Recommendations

• Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
• A projective simplex algorithm using LU decomposition
• Stable modification of explicitLU factors for simplex updates
• scientific article; zbMATH DE number 3852785
• A Block-$LU$ Update for Large-Scale Linear Programming

Cited in

(7)

• scientific article; zbMATH DE number 3856815 (Why is no real title available?)
• scientific article; zbMATH DE number 800097 (Why is no real title available?)
• Das Triplex-Verfahren
• Non-probabilistic polygonal convex set model for structural uncertainty quantification
• Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
• A Z-simplex algorithm with partial updates
• Construction of LU Factors of the Basis to Reduce Build-Up during Simplex Iterations

This page was built for publication: A simplex method algorithm using a double basis

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