Letter to the Editor—Examples Relating to the Simplex Method

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.