Abstract
Since statisticians are interested in optimal incomplete block designs, the existence of algorithms to construct them can be notable. This article presents an algorithm to search for Φp-optimal or nearly Φp-optimal incomplete block designs. It is a variant of exchange and interchange procedures of Jones and Eccleston. The algorithm starts by constructing a cyclic design as the initial design. Then it enters a modified exchange and interchange procedures. Since our criterion for optimality is Φp, the algorithm utilizes the eigenvalues of the information matrix of designs. In most of the cases, optimal or nearly optimal designs were found, which shows the good performance of the algorithm. In addition, a new virtual design for has been obtained. So, for situations in which optimal incomplete block designs are required, this algorithm can be used.
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: Communications in Statistics - Simulation and Computation
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.
