Devex algorithm: Difference between revisions
Content deleted Content added
No edit summary |
m WP:CHECKWIKI error fix for #61. Punctuation goes before References. Do general fixes if a problem exists. - using AWB (9421) |
||
| Line 1: | Line 1: | ||
{{ |
{{refimprove|date=August 2013}} |
||
In applied mathematics, the '''devex algorithm''' is a pivot rule for the [[simplex method]] developed by Harris |
In applied mathematics, the '''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== |
==References== |
||
{{reflist}} |
{{reflist}} |
||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
Revision as of 21:28, 14 August 2013
 | 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 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. |