Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems

We present an O(nv)Basis Oriented Pivoting (BOP) algorithm for enumerating vertices of simple polyhedra associated with dual LI(2) systems. The algorithm is based on a characterisation of their graphical basis structures, whose set of edges are shown to consist of vertex-disjoint components that are either a tree or a subgraph with only one cycle. The algorithm generates vertices via operations on the basis graph, rather than by simplex transformations.

[1]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[2]  Bengt Aspvall,et al.  A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality , 1980, SIAM J. Comput..

[3]  M. E. Dyer,et al.  The Complexity of Vertex Enumeration Methods , 1983, Math. Oper. Res..

[4]  Martin E. Dyer,et al.  An algorithm for determining all extreme points of a convex polytope , 1977, Math. Program..

[5]  T. H. Matheiss,et al.  A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets , 1980, Math. Oper. Res..

[6]  Sammani Danwawu Abdullahi.  Vertex enumeration and counting for certain classes of polyhedra , 2002 .

[7]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[8]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 3: Sorting and Searching , 1974 .

[9]  J. Scott Provan.  Efficient enumeration of the vertices of polyhedra associated with network LP's , 1994, Math. Program..

[10]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[11]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[12]  Edith Cohen,et al.  Improved algorithms for linear inequalities with two variables per inequality , 1991, STOC '91.

[13]  H. P. Williams.  Fourier's Method of Linear Programming and its Dual , 1986 .

[14]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[15]  Joseph Naor,et al.  Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality , 1994, SIAM J. Comput..

[16]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[17]  Robert E. Shostak,et al.  Deciding Linear Inequalities by Computing Loop Residues , 1981, JACM.

[18]  Pierre Hansen,et al.  On-line and off-line vertex enumeration by adjacency lists , 1991, Oper. Res. Lett..

[19]  David Avis,et al.  A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1992, Discret. Comput. Geom..