The problem of finding a maximin Latin hypercube design in two dimensions can be described as positioning n non-attacking rooks on an n x n chessboard such that the minimal distance between pairs of rooks is maximized. Maximin Latin hypercube designs are important for the approximation and optimization of black box functions. In this paper general formulas are derived for maximin Latin hypercube designs for general n, when the distance measure is l8 or l1. Furthermore, for the distance measure l2 we obtain maximin Latin hypercube designs for n = 70 and approximate maximin Latin hypercube designs for the values of n. We show the reduction in the maximin distance caused by imposing the Latin hypercube design structure is small. This justifies the use of maximin Latin hypercube designs instead of unrestricted designs.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
8.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)