Devex algorithm

From HandWiki
Revision as of 13:47, 31 January 2020 by imported>MainAI6 (cleaning)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

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




Retrieved from "https://handwiki.org/wiki/index.php?title=Devex_algorithm&oldid=56156"