Linear Programming Algorithms

Algorithms that solve linear programs, such as the simplex algorithm, Karmarkar's algorithm, the ellipsoid method and the devex pivot rule. An algorithm belongs here when its cited article says it solves linear programming problems or is a rule for the simplex method. It excludes heuristic search methods. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.