// Workers AI · dad joke modeWhat did the Devex algorithm say? "I've got a complex problem to ex-change.

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 adding missing information.

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

This page was redesigned at the edge.

A page that knows where it met you.

// Workers AI · dad joke modeWhat did the Devex algorithm say? "I've got a complex problem to ex-change.

References