A steepest edge active set algorithm for solving sparse linear programming problems

DOI10.1002/nme.1620261207zbMath0678.65041OpenAlexW2067733350MaRDI QIDQ3834960

Scott W. Sloan

Publication date: 1988

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620261207

zbMATH Keywords

active set algorithmNumerical experiencesparse linear programsDantzig search schemessteepest edge

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items (8)

Numerical treatment of nonlinear MHD Jeffery-Hamel problems using stochastic algorithms ⋮ Upper bound limit analysis using linear finite elements and non-linear programming ⋮ Stochastic numerical treatment for solving Troesch's problem ⋮ Hardness-packing density scaling relations for cohesive-frictional porous materials ⋮ Rigid-plastic finite element analysis of steel plates, structural girders and connections. ⋮ An upper-bound limit analysis of Mindlin plates using CS-DSG3 method and second-order cone programming ⋮ Bio-inspired computing platform for reliable solution of Bratu-type equations arising in the modeling of electrically conducting solids ⋮ Upper bound limit analysis using discontinuous velocity fields

Cites Work

• Unnamed Item

This page was built for publication: A steepest edge active set algorithm for solving sparse linear programming problems