Devex algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 14:11, 2 August 2013

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

^ 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 mathematics-related article is a stub. You can help Wikipedia by expanding it.

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

[1]

[2]

@@ Line 6: / Line 6: @@
 {{math-stub}}
-{{Uncategorized stub|date=August 2013}}
+[[Category:Algorithms]]