A simplex method algorithm using a double basis

DOI10.1134/S1995423915040011zbMath1349.90616OpenAlexW2287854709MaRDI QIDQ5741301

Gerard Idelfonovich 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

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

Related Items (1)

Non-probabilistic polygonal convex set model for structural uncertainty quantification

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