Letter to the Editor—Examples Relating to the Simplex Method
- 1 February 1964
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 12 (1) , 159-161
- https://doi.org/10.1287/opre.12.1.159
Abstract
An example is given showing that the most common variant of the simplex algorithm does not satisfy a condition conjectured by Saaty in an analysis of the maximum possible number of iterations. Situations are exhibited in which the simplex method encounters all vertices of the constraint polyhedron.Keywords
This publication has 0 references indexed in Scilit: