Advanced Search
MyIDEAS: Login to save this paper or follow this series

Bounds for Maximin Latin Hypercube Designs


Author Info

  • Dam, E.R. van
  • Rennen, G.
  • Husslage, B.G.M.

    (Tilburg University, Center for Economic Research)


Latin hypercube designs (LHDs) play an important role when approximating computer simula- tion 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 approximate 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 approximate 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 struc- ture. 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 vari- ety of combinatorial optimization techniques are employed. Mixed Integer Programming, the Travelling 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 ℓ1 distance measure for certain values of n.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. 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.
File URL:
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2007-16.

as in new window
Date of creation: 2007
Date of revision:
Handle: RePEc:dgr:kubcen:200716

Contact details of provider:
Web page:

Related research

Keywords: Latin hypercube design; maximin; space-filling; mixed integer programming; trav- elling salesman problem; graph covering.;

Other versions of this item:

This paper has been announced in the following NEP Reports:


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.:
as in new window
  1. den Hertog, Dick & Stehouwer, Peter, 2002. "Optimizing color picture tubes by high-cost nonlinear programming," European Journal of Operational Research, Elsevier, vol. 140(2), pages 197-211, July.
  2. Dam, E.R. van & Husslage, B.G.M. & Hertog, D. den & Melissen, H., 2005. "Maximin Latin Hypercube Designs in Two Dimensions," Discussion Paper 2005-8, Tilburg University, Center for Economic Research.
  3. Husslage, B.G.M., 2006. "Maximin Designs for Computer Experiments," Open Access publications from Tilburg University urn:nbn:nl:ui:12-189738, Tilburg University.
  4. Driessen, L., 2006. "Simulation-Based Optimization for Product and Process Design," Open Access publications from Tilburg University urn:nbn:nl:ui:12-182338, Tilburg University.
  5. Stinstra, E., 2006. "The Meta-Model Approach for Simulation-based Design Optimization," Open Access publications from Tilburg University urn:nbn:nl:ui:12-189750, Tilburg University.
  6. Husslage, B.G.M. & Rennen, G. & Dam, E.R. van & Hertog, D. den, 2006. "Space-Filling Latin Hypercube Designs for Computer Experiments (Replaced by CentER DP 2008-104)," Discussion Paper 2006-18, Tilburg University, Center for Economic Research.
Full references (including those not matched with items on IDEAS)


Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Husslage, B.G.M. & Rennen, G. & Dam, E.R. van & Hertog, D. den, 2008. "Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18)," Discussion Paper 2008-104, Tilburg University, Center for Economic Research.
  2. Rennen, G. & Husslage, B.G.M. & Dam, E.R. van & Hertog, D. den, 2009. "Nested Maximin Latin Hypercube Designs," Discussion Paper 2009-06, Tilburg University, Center for Economic Research.


This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:dgr:kubcen:200716. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.