Year-end Sale % OFF 
Abstract
The concept of balanced arrays is related to factorial designs, orthogonal arrays, (r, ⋋,)-designs, and t-designs. In this paper the concept of resolvability of block designs is generalized to -resolvability of balanced arrays. A method of extending the constraints of resolvable balanced arrays with gradually increasing size (experimental runs) is given. This method of construction is also applied to constructing asymmetrical balanced arrays and group-divisible (GD) designs where ⋋2 = ⋋1 + 1.
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 callDisclaimer: 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.
