Devex algorithm

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Devex algorithm" – news · newspapers · books · scholar · JSTOR (August 2013) (Learn how and when to remove this message)

In applied mathematics, the devex algorithm is a pivot rule for the simplex method developed by Paula M. J. Harris.^[1] It identifies the steepest-edge approximately in its search for the optimal solution.^[2]

References

^ Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1–28.
^ Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1–3 (1992): 341–374.

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Devex_algorithm&oldid=927881807"