In 1951, Alan J. Hoffman provided the first example that demonstrated that Dantzig's simplex method for linear programming can cycle (unless special precautions are taken). This paper describes a geometry for understanding Hoffman's example--something that has been lacking for over two-fifths of a century.
For the newest resources, visit Wolfram Repositories and Archives »
