Devex algorithm: Difference between revisions
Content deleted Content added
+wikilink |
Full name |
||
| Line 1: | Line 1: | ||
{{refimprove|date=August 2013}} |
{{refimprove|date=August 2013}} |
||
In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris.<ref>Harris, Paula MJ. "[https://link.springer.com/article/10.1007/BF01580108 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]]. "[https://link.springer.com/article/10.1007/BF01581089 Steepest-edge simplex algorithms for linear programming]." Mathematical programming 57.1–3 (1992): 341–374.</ref> |
In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Paula M. J. Harris.<ref>Harris, Paula MJ. "[https://link.springer.com/article/10.1007/BF01580108 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]]. "[https://link.springer.com/article/10.1007/BF01581089 Steepest-edge simplex algorithms for linear programming]." Mathematical programming 57.1–3 (1992): 341–374.</ref> |
||
==References== |
==References== |
||
Latest revision as of 10:56, 25 November 2019
 | This article needs additional citations for verification. (August 2013) |
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
[edit]- ^ 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 algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it. |