On the choice of the pivot columns of the simplex-method: Gradient criteria
From MaRDI portal
Publication:1097836
DOI10.1007/BF02253740zbMath0635.90056MaRDI QIDQ1097836
Publication date: 1987
Published in: Computing (Search for Journal in Brave)
simplex algorithm; Monte Carlo simulation; pivoting; gradient criteria; steepest unit ascent criteria
Related Items
A computational study of redundancy in randomly generated polytopes, Selected bibliography on degeneracy, On scaling linear programs—some experimental results
Uses Software