A theoretical comparison between the simplex method and the basic line search algorithm

DOI10.1080/02331934.2014.979324zbMath1332.90155OpenAlexW2089991382MaRDI QIDQ2790864

Mahesh N. Dumaldar

Publication date: 8 March 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.979324

zbMATH Keywords

linear programmingsimplex methodbasic line search algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Some fundamental issues of basic line search algorithm for linear programming problems

This page was built for publication: A theoretical comparison between the simplex method and the basic line search algorithm