Devex algorithm

{{refimprove|date=August 2013}} In applied mathematics, the '''devex algorithm''' is a pivot rule for the simplex method developed by Paula M. J. Harris.<ref>Harris, Paula MJ. "[https://link.springer.com/article/10.1007/BF01580108 Pivot selection methods of the Devex LP code]." Mathematical programming 5.1 (1973): 1–28.</ref> It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "[https://link.springer.com/article/10.1007/BF01581089 Steepest-edge simplex algorithms for linear programming]." Mathematical programming 57.1–3 (1992): 341–374.</ref>

==References== {{reflist}}

Category:Algorithms

{{algorithm-stub}}