English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30546
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


MBMUDs: a combinatorial extension of BIBDs showing good optimality behaviour

AuthorsBofill, Pau; Torras, Carme
KeywordsBlock design
Maximally balanced design
Distribution measure
Cost function
Issue Date2004
CitationJournal of Statistical Planning and Inference 124(1): 185-204 (2004)
AbstractThe construction of a Balanced Incomplete Block Design (BIBD) is formulated in terms of combinatorial optimization by defining a cost function that reaches its lower bound on all and only those configurations corresponding to a BIBD. This cost function is a linear combination of distribution measures for each of the properties of a block design (number of plots, uniformity of rows, uniformity of columns, and balance). The approach generalizes naturally to a super-class including BIBDs, which we call Maximally Balanced Maximally Uniform Designs (MBMUDs), that allow two consecutive values for their design parameters [r,r+1;k,k+1;\lambda,\lambda+1]. In terms of combinatorial balance, MBMUDs are the closest possible approximation to BIBDs for all experimental settings where no set of admissible parameters exists. Thus, other design classes previously proposed with the same approximation aim --such as RDGs, SRDGs and NBIBDs of type I-- can be viewed as particular cases of MBMUDs. Interestingly, experimental results show that the proposed combinatorial cost function has a monotonic relation with A- and D-statistical optimality in the space of designs with uniform rows and columns, while its computational cost is much lower.
Publisher version (URL)http://dx.doi.org/10.1016/S0378-3758(03)00192-7
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
MBMUDs.pdf321,27 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.