World Academy of Science, Engineering and Technology
Published January 2, 2016 | Version 10003676
Journal article Open

Exploring Counting Methods for the Vertices of Certain Polyhedra with Uncertainties

Authors/Creators

Description

Vertex Enumeration Algorithms explore the methods and procedures of generating the vertices of general polyhedra formed by system of equations or inequalities. These problems of enumerating the extreme points (vertices) of general polyhedra are shown to be NP-Hard. This lead to exploring how to count the vertices of general polyhedra without listing them. This is also shown to be #P-Complete. Some fully polynomial randomized approximation schemes (fpras) of counting the vertices of some special classes of polyhedra associated with Down-Sets, Independent Sets, 2-Knapsack problems and 2 x n transportation problems are presented together with some discovered open problems.

Files

10003676.pdf

Files (179.0 kB)

Name Size Download all
md5:dfdf43e6dcd6f4bbc5009aa119bdc16e
179.0 kB Preview Download

Additional details

References

  • Abdullahi, S. D. (2002) Vertex Enumeration and Counting for Certain Classes of Polyhedra. School of Computing. The University of Leeds.
  • Dyer, M. E. (1983) The Complexity of Vertex enumeration methods. Mathematics of Operation Research. 8 381 - 402.
  • Hadley, G. (1962) Linear Programming Addison-Wesley.
  • Dyer, M. E. (1979) Vertex Enumeration in Mathematical Programming: Methods and Applications. Department of Computer Studies. The University of Leeds.
  • Jerrum, M. (1995) The computational complexity of counting. International Congress of Mathematicians. Birkhauser, Basel 1995.
  • Jerrum, M. and Sinclair, A. (1996) The Markov Chain Monte Carlo method: an approach to approximate counting and integration. PWS Publishing, Boston.
  • Garey, A. M. and Johnson, D. S. (1979) Computers and Intractability Freeman.
  • Dyer, M. and Greenhil, C. (2000) On Markov Chains for Independent Sets. Journal of Algorithms. 35 17 - 49.
  • Dyer, M. E., Goldberg, L. A., Greenhill, C. S. and Jerrum, M. R. (2000) On the Relative Complexity of Approximate Counting Problems Springer-Verlag.