Devex algorithm: Difference between revisions
Content deleted Content added
m added source |
No edit summary |
||
| Line 1: | Line 1: | ||
{{ |
{{ref improve|date=August 2013}} |
||
'''Devex algorithm''' is a pivot rule for the [[Simplex Method]] developed by Harris <ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1-28.</ref>. It identifies the steepest-edge approximately in its search for the optimal solution. |
'''Devex algorithm''' is a pivot rule for the [[Simplex Method]] developed by Harris <ref>Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1-28.</ref>. It identifies the steepest-edge approximately in its search for the optimal solution.<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1-3 (1992): 341-374.</ref> |
||
==References== |
|||
{{reflist}} |
|||
{{stub}} |
{{math-stub}} |
||
{{Uncategorized stub|date=August 2013}} |
{{Uncategorized stub|date=August 2013}} |
||
<ref>Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1-3 (1992): 341-374.</ref> |
|||
Revision as of 14:10, 2 August 2013
 | This article needs additional citations for verification. (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
 | This mathematics-related 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) |