Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra

C. G. E. Boender, R. J. Caron, J. F. McDonald, A. H. G. Rinnooy Kan, H. E. Romeijn, R. L. Smith, J. Telgen and Ton Vorst ()
Additional contact information
C. G. E. Boender: Erasmus University, Rotterdam, The Netherlands
R. J. Caron: University of Windsor, Windsor, Ontario, Canada
J. F. McDonald: University of Windsor, Windsor, Ontario, Canada
A. H. G. Rinnooy Kan: Erasmus University, Rotterdam, The Netherlands
H. E. Romeijn: Erasmus University, Rotterdam, The Netherlands
R. L. Smith: University of Michigan, Ann Arbor, Michigan
J. Telgen: University of Twente, Enschede, The Netherlands

Operations Research, 1991, vol. 39, issue 6, 945-954

Abstract: We present a class of shake-and-bake algorithms for generating (asymptotically) uniform points on the boundary of full-dimensional bounded polyhedra. We also report results of simulations for some elementary test problems.

Keywords: simulation; random variable generation: generating asymptotically uniform points on the boundary of a polytope (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.39.6.945 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:39:y:1991:i:6:p:945-954

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().