An overview on the simplex algorithm

DOI10.1016/j.amc.2009.01.013zbMath1162.65355OpenAlexW2091417492MaRDI QIDQ1021548

Hédi Nabli

Publication date: 8 June 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.01.013

zbMATH Keywords

linear programmingsimplex algorithmtwo-phase methodbig-M methoddual-simplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (4)

Algebraic simplex initialization combined with the nonfeasible basis method ⋮ On the simplex algorithm initializing ⋮ A generalized objective function based on weight coefficient for topology-finding of tensegrity structures ⋮ A triangulation and fill-reducing initialization procedure for the simplex algorithm

Uses Software

• MarPlex

Cites Work

• A note on ``An improved initial basis for the simplex algorithm
• The many facets of linear programming
• A new efficient primal dual simplex algorithm
• A practicable steepest-edge simplex algorithm
• Linear Programming
• Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An overview on the simplex algorithm