An algorithm for arranging response surface designs in small blocks

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.contributorUniv Reading
dc.date.accessioned2014-05-20T13:47:44Z
dc.date.available2014-05-20T13:47:44Z
dc.date.created2014-05-20T13:47:44Z
dc.date.issued2000-03-28
dc.identifierComputational Statistics & Data Analysis. Amsterdam: Elsevier B.V., v. 33, n. 1, p. 25-43, 2000.
dc.identifier0167-9473
dc.identifierhttp://hdl.handle.net/11449/17005
dc.identifier10.1016/S0167-9473(99)00033-X
dc.identifierWOS:000085935100003
dc.identifier3720489366427955
dc.description.abstractWe consider the problem of blocking response surface designs when the block sizes are prespecified to control variation efficiently and the treatment set is chosen independently of the block structure. We show how the loss of information due to blocking is related to scores defined by Mead and present an interchange algorithm based on scores to improve a given blocked design. Examples illustrating the performance of the algorithm are given and some comparisons with other designs are made. (C) 2000 Elsevier B.V. B.V. All rights reserved.
dc.languageeng
dc.publisherElsevier B.V.
dc.relationComputational Statistics & Data Analysis
dc.relation1.181
dc.relation1,396
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectblocking
dc.subjectscores
dc.subjectinterchange algorithm
dc.subjectsecond-order model
dc.subjectcentral composite design
dc.subjectBox-Behnken design
dc.subjectweighted mean efficiency factor
dc.titleAn algorithm for arranging response surface designs in small blocks
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución