Maximin Latin Hypercube Designs in Two Dimensions

Research output: Working paperDiscussion paperOther research output

421 Downloads (Pure)

Abstract

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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages16
Volume2005-8
Publication statusPublished - 2005

Publication series

NameCentER Discussion Paper
Volume2005-8

Keywords

  • Branch-and-bound
  • circle packing
  • Latin hypercube design
  • mixed integer programming
  • non-collapsing
  • space-filling

Fingerprint Dive into the research topics of 'Maximin Latin Hypercube Designs in Two Dimensions'. Together they form a unique fingerprint.

Cite this