# Devex algorithm

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Devex_algorithm
> Markdown URL: https://mediated.wiki/source/Devex_algorithm.md
> Source: https://en.wikipedia.org/wiki/Devex_algorithm
> Source revision: 927881807
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

{{refimprove|date=August 2013}}
In applied mathematics, the '''devex algorithm''' is a pivot rule for the [simplex method](/source/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](/source/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}}

---
Adapted from the Wikipedia article [Devex algorithm](https://en.wikipedia.org/wiki/Devex_algorithm) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Devex_algorithm?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.