Computational Challenges in Determining an Optimal Design for an Experiment

Subir Ghosh ()
Additional contact information
Subir Ghosh: University of California

A chapter in COMPSTAT 2004 — Proceedings in Computational Statistics, 2004, pp 181-188 from Springer

Abstract: Abstract In this paper we present some computationally challenging problems for finding an optimum design in an experiment. We consider the problem of finding an optimum design when one model from a set of possible models would describe the data better than other models in the set but we do not know this model a priori. We also consider the robustness of optimum designs under a model when some observations are unavailable.

Keywords: Balanced arrays; computational challenges; factorial designs; interactions; orthogonal arrays; robust designs; search designs; search linear models; search probabilities; unavailability of data (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sprchp:978-3-7908-2656-2_14

Ordering information: This item can be ordered from
http://www.springer.com/9783790826562

DOI: 10.1007/978-3-7908-2656-2_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().