Jump to content

Devex algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Qx2020 (talk | contribs) at 09:41, 2 August 2013 (added source). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article does not cite any sources. 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)

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.

This article is a stub. You can help Wikipedia by expanding it.

This article has not been added to any content categories. Please help out by adding categories to it so that it can be listed with similar articles, in addition to a stub category. (August 2013)

^ 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.

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

Uncategorized from August 2013

Hidden categories: