A simplex method algorithm using a double basis

DOI10.1134/S1995423915040011zbMATH Open1349.90616OpenAlexW2287854709MaRDI QIDQ5741301FDOQ5741301

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

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

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)

Cited In (7)

• Non-probabilistic polygonal convex set model for structural uncertainty quantification
• Construction of LU Factors of the Basis to Reduce Build-Up during Simplex Iterations
• Implementation of a Double-Basis Simplex Method for the General Linear Programming Problem
• Title not available (Why is that?)
• A Z-simplex algorithm with partial updates
• Title not available (Why is that?)
• Das Triplex-Verfahren

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)