Abstract
We examine the polyhedral structure of Balanced Incomplete Block Designs (BIBDs) in an effort to improve runtimes for finding optimal solutions via constraint or integer program. For example, an optimal BIBD is one that minimizes the range of blocksums. This range, which we refer to as diffsum, has applications in drug trials and Redundant Arrays of Independent Disks (RAID). The polytope we explore is the convex hull of all lexicographically-ordered BIBD solutions satisfying a given set of parameters, ( v , b , r , k , λ ) , with solutions represented as a vector in R kb . The dimension-reducing equations and the facets for some of the smaller polytopes were found by using the Double-Description Method on a algebraic program modelling these solutions. Because of the presence of the lexicographic ordering, none of these polytopes are full dimensional. After describing some of these smaller BIBD polytopes, we generalize some dimension-reducing equations, and evaluate the efficiency of these equations to optimization models.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Mathematics: Computer Systems Theory
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
