A Parallel probabilistic algorithm to find "all" vertices of a polytope

This paper presents a new parallel algorithm to find all vertices of a convex polytope. This algorithm is of Monte-Carlo type and requires no assumption of problem nondegeneracy. Redundant constraints have no influence on the main computation. The vertex locating routine uses a new algorithm for nearest point problem in polytopes.