Devex algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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

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