A new steepest edge approximation for the simplex method for linear programming
From MaRDI portal
Publication:1273430
DOI10.1023/A:1018317206484zbMath0912.90220MaRDI QIDQ1273430
Publication date: 1998
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (1)
Uses Software
This page was built for publication: A new steepest edge approximation for the simplex method for linear programming