A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
CRM Proceedings and Lecture notes AMS
The possible pivot operations of the simplex method to solve a linear program can be represented as a directed graph defined on the skeleton of the feasible region P . We consider the case that P is bounded, i.e., a convex polytope. The directed graph is called an LP digraph. LP digraphs are known to satisfy the following three properties: acyclicity, unique sink orientation(USO), and the Holt-Klee property. The three properties are not generally sufficient for a directed graph on the skeletondoi:10.1090/crmp/048/01 fatcat:gqzkpxfccfgg3k65ref5dp4mxa