Devex_algorithm

Devex algorithm

Devex algorithm

Add article description

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


Stub icon

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

This article uses material from the Wikipedia article Devex_algorithm, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.