In applied mathematics, the devex algorithm is a pivot rule for the simplex method developed by Paula M. J. Harris. It identifies the steepest-edge approximately in its search for the optimal solution.
We don't have any images related to Devex algorithm yet.
You can add one yourself here.
We don't have any YouTube videos related to Devex algorithm yet.
You can add one yourself here.
We don't have any PDF documents related to Devex algorithm yet.
You can add one yourself here.
We don't have any Books related to Devex algorithm yet.
You can add one yourself here.
We don't have any archived web articles related to Devex algorithm yet.
References
Harris, Paula MJ. "Pivot selection methods of the Devex LP code." Mathematical programming 5.1 (1973): 1–28. https://link.springer.com/article/10.1007/BF01580108 ↩
Forrest, John J., and Donald Goldfarb. "Steepest-edge simplex algorithms for linear programming." Mathematical programming 57.1–3 (1992): 341–374. /wiki/Donald_Goldfarb ↩