Devex algorithm: Difference between revisions

Content deleted Content added

Inline

Revision as of 21:51, 3 October 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

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

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

Revision as of 21:28, 14 August 2013 edit BG19bot (talk \| contribs) 1,005,055 edits m WP:CHECKWIKI error fix for #61. Punctuation goes before References. Do general fixes if a problem exists. - using AWB (9421) ← Previous edit		Revision as of 21:51, 3 October 2013 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 232,243 edits {{algorithm-stub}} Next edit →
Line 8:		Line 8:


	{{~~math~~-stub}}		{{algorithm-stub}}