Bounds for Maximin Latin Hypercube Designs

Edwin van Dam, Gijs Rennen () and Bart Husslage ()
Additional contact information
Gijs Rennen: Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Netherlands
Bart Husslage: Department of Econometrics and Operations Research, Tilburg University, Tilburg, The Netherlands

Operations Research, 2009, vol. 57, issue 3, 595-608

Abstract: Latin hypercube designs (LHDs) play an important role when approximating computer simulation models. To obtain good space-filling properties, the maximin criterion is frequently used. Unfortunately, constructing maximin LHDs can be quite time consuming when the number of dimensions and design points increase. In these cases, we can use heuristical maximin LHDs. In this paper, we construct bounds for the separation distance of certain classes of maximin LHDs. These bounds are useful for assessing the quality of heuristical maximin LHDs. Until now only upper bounds are known for the separation distance of certain classes of unrestricted maximin designs, i.e., for maximin designs without a Latin hypercube structure. The separation distance of maximin LHDs also satisfies these “unrestricted” bounds. By using some of the special properties of LHDs, we are able to find new and tighter bounds for maximin LHDs. Within the different methods used to determine the upper bounds, a variety of combinatorial optimization techniques are employed. Mixed-integer programming, the traveling salesman problem, and the graph-covering problem are among the formulations used to obtain the bounds. Besides these bounds, also a construction method is described for generating LHDs that meet Baer's bound for the (l-script) (infinity) distance measure for certain values of n .

Keywords: simulation; design of experiments; Latin hypercube design; maximin; space-filling; mixed-integer programming; traveling salesman problem; graph covering (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1080.0604 (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:57:y:2009:i:3:p:595-608

Access Statistics for this article

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