Devex algorithm

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


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.