Approximate Solutions of Continuous Dispersion Problems

Artan Dimnaku (), Rex Kincaid () and Michael Trosset ()

Annals of Operations Research, 2005, vol. 136, issue 1, 65-80

Abstract: The problem of positioning p points so as to maximize the minimum distance between them has been studied in both location theory (as the continuous p-dispersion problem) and the design of computer experiments (as the maximin distance design problem). This problem can be formulated as a nonlinear program, either exactly or approximately. We consider formulations of both types and demonstrate that, as p increases, it becomes dramatically more expensive to compute solutions of the exact formulation than to compute solutions of the approximate formulation. Copyright Springer Science + Business Media, Inc. 2005

Keywords: maximin distance designs; space-filling designs; computer experiments; location theory; nonlinear programming (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-2039-z (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:136:y:2005:i:1:p:65-80:10.1007/s10479-005-2039-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-005-2039-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().