In applied mathematics, the devex algorithm is a pivot rule for the

simplex method In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is a popular algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex and was suggested by T. S. Motzkin. Simplices are no ...

developed by Paula M. J. Harris. It identifies the steepest-edge approximately in its search for the optimal solution.Forrest, John J., and

Donald Goldfarb Donald Goldfarb (born August 14, 1941 in New York City) is an American mathematician, best known for his works in mathematical optimization and numerical analysis. Goldfarb studied Chemical Engineering at Cornell University, earning a BSChE in 196 ...

.
Steepest-edge simplex algorithms for linear programming
" Mathematical programming 57.1–3 (1992): 341–374.

References

Algorithms {{algorithm-stub