Jump to content

Devex algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 21:51, 3 October 2013 ({{algorithm-stub}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In applied mathematics, the devex algorithm is a pivot rule for the simplex method developed by 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.


Stub icon

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=575642723"