This thesis is an investigation of the optimality and construction problems attendant to the assignment of v treatments to experimental units in b blocks of size k, paying special attention to settings for which equal replication of the treatments is not possible. The model is that of one way elimination of heterogeneity, in which the expectation of an observation on treatment i in block j is Ti + βj (treatment effect + block effect), where Ti and βj are unknown constants, 1 ≤ i ≤ v and 1 ≤ j ≤ b. All observations are assumed to be uncorrelated with same variance.
The generalized group divisible design with s groups, or GGDD(s), is defined in terms of the elements of the information matrix, instead of in terms of the elements of the concurrence matrix as done by Adhikary (1965) and extended by Jacroux (1982). This definition extends the class of designs to include non-binary members, and allows for broader optimality results. Some sufficient conditions are derived for GGDD(s) to be E- and MV-optimal. It is also shown how augmentation of addition blocks to certain GGDD(s)s produces other nonbinary, unequally replicated E- and MV-optimal block designs. Where nonbinary designs are found, they are generally preferable to binary designs in terms of interpretability, and often in terms of one or more formal optimality criteria as well.
The class of generalized nearly balanced incomplete block designs with maximum concurrence range l, or NBBD(l), is defined. This class extends the nearly balance incomplete block designs as defined by Cheng & Wu (1981), and the semi-regular graph designs as defined by Jacroux (1985), to cases where off-diagonal entries of the concurrence matrix differ by at most the positive integer l. Sufficient conditions are derived for a NBBD(2) to be optimal under a given type-I criterion. The conditions are used to establish the A- and D-optimality of an infinite series of NBBD(2)s having unequal numbers of replicates. Also, a result from Jacroux (1985) is used to establish the A-optimality of a new series of NBBD(1)s.
Several methods of construction of GGDD(s)s are developed from which many infinite series of designs are derived. Generally these designs satisfy the obtained sufficient conditions for E- and MV-optimality.
Finally, in the nested row-column setting, the necessary conditions for existence of 2 x 2 balanced incomplete block designs with nested rows and columns (BIBRCs) are found to be sufficient. It is also shown that, sufficient for a BIBRC with p=q to generally balanced, is that the row and column classifications together form a balanced incomplete block design, as does the block classification. All of the 2 x 2 BIBRCs are constructed to have this property.
","abstract_html":"<p>This thesis is an investigation of the optimality and construction problems attendant to the assignment of v treatments to experimental units in b blocks of size k, paying special attention to settings for which equal replication of the treatments is not possible. The model is that of one way elimination of heterogeneity, in which the expectation of an observation on treatment <em>i</em> in block <em>j</em> is <em>T<sub>i</sub></em> + βj (treatment effect + block effect), where <em>T<sub>i</sub></em> and βj are unknown constants, 1 <em>≤ i ≤ v</em> and 1<em> ≤ j ≤ b</em>. All observations are assumed to be uncorrelated with same variance.</p> <p>The generalized group divisible design with s groups, or GGDD(s), is defined in terms of the elements of the information matrix, instead of in terms of the elements of the concurrence matrix as done by Adhikary (1965) and extended by Jacroux (1982). This definition extends the class of designs to include non-binary members, and allows for broader optimality results. Some sufficient conditions are derived for GGDD(s) to be E- and MV-optimal. It is also shown how augmentation of addition blocks to certain GGDD(s)s produces other nonbinary, unequally replicated E- and MV-optimal block designs. Where nonbinary designs are found, they are generally preferable to binary designs in terms of interpretability, and often in terms of one or more formal optimality criteria as well.</p> <p>The class of generalized nearly balanced incomplete block designs with maximum concurrence range <em>l</em>, or NBBD(l), is defined. This class extends the nearly balance incomplete block designs as defined by Cheng & Wu (1981), and the semi-regular graph designs as defined by Jacroux (1985), to cases where off-diagonal entries of the concurrence matrix differ by at most the positive integer <em>l</em>. Sufficient conditions are derived for a NBBD(2) to be optimal under a given type-I criterion. The conditions are used to establish the A- and D-optimality of an infinite series of NBBD(2)s having unequal numbers of replicates. Also, a result from Jacroux (1985) is used to establish the A-optimality of a new series of NBBD(1)s.</p> <p>Several methods of construction of GGDD(s)s are developed from which many infinite series of designs are derived. Generally these designs satisfy the obtained sufficient conditions for E- and MV-optimality.</p> <p>Finally, in the nested row-column setting, the necessary conditions for existence of 2 x 2 balanced incomplete block designs with nested rows and columns (BIBRCs) are found to be sufficient. It is also shown that, sufficient for a BIBRC with p=q to generally balanced, is that the row and column classifications together form a balanced incomplete block design, as does the block classification. All of the 2 x 2 BIBRCs are constructed to have this property.</p>","abstract_has_math":false,"creators":["Srivastav, Sudesh K."],"institution":null,"degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Mathematics & Statistics","degree_department":null,"school":null,"contributors":["John P. Morgan","Narasinga R. Chaganty","Ram Dahiya","Edward Markowski","Dayanand N. Naik"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1996,"date_issued":"1996-07-01T07:00:00Z","date_published":"1996-07-01T07:00:00Z","updated_at":"2026-07-24T03:35:00Z","subjects":["Optimality","Construction of designs","Statistics and Probability"],"languages":[],"rights":["In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["9780591048698"],"render_values":[{"text":"9780591048698","href":null,"code":true}]}]},"links":{"outbound_url":"https://digitalcommons.odu.edu/mathstat_etds/66","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["John P. Morgan","Narasinga R. Chaganty","Ram Dahiya","Edward Markowski","Dayanand N. Naik"]},{"key":"dc:creator","label":"Author","values":["Srivastav, Sudesh K."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2019-06-13T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics & Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Optimality","Construction of designs","Statistics and Probability"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["9780591048698","https://digitalcommons.odu.edu/mathstat_etds/66"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis is an investigation of the optimality and construction problems attendant to the assignment of v treatments to experimental units in b blocks of size k, paying special attention to settings for which equal replication of the treatments is not possible. The model is that of one way elimination of heterogeneity, in which the expectation of an observation on treatment i in block j is Ti + βj (treatment effect + block effect), where Ti and βj are unknown constants, 1 ≤ i ≤ v and 1 ≤ j ≤ b. All observations are assumed to be uncorrelated with same variance.
The generalized group divisible design with s groups, or GGDD(s), is defined in terms of the elements of the information matrix, instead of in terms of the elements of the concurrence matrix as done by Adhikary (1965) and extended by Jacroux (1982). This definition extends the class of designs to include non-binary members, and allows for broader optimality results. Some sufficient conditions are derived for GGDD(s) to be E- and MV-optimal. It is also shown how augmentation of addition blocks to certain GGDD(s)s produces other nonbinary, unequally replicated E- and MV-optimal block designs. Where nonbinary designs are found, they are generally preferable to binary designs in terms of interpretability, and often in terms of one or more formal optimality criteria as well.
The class of generalized nearly balanced incomplete block designs with maximum concurrence range l, or NBBD(l), is defined. This class extends the nearly balance incomplete block designs as defined by Cheng & Wu (1981), and the semi-regular graph designs as defined by Jacroux (1985), to cases where off-diagonal entries of the concurrence matrix differ by at most the positive integer l. Sufficient conditions are derived for a NBBD(2) to be optimal under a given type-I criterion. The conditions are used to establish the A- and D-optimality of an infinite series of NBBD(2)s having unequal numbers of replicates. Also, a result from Jacroux (1985) is used to establish the A-optimality of a new series of NBBD(1)s.
Several methods of construction of GGDD(s)s are developed from which many infinite series of designs are derived. Generally these designs satisfy the obtained sufficient conditions for E- and MV-optimality.
Finally, in the nested row-column setting, the necessary conditions for existence of 2 x 2 balanced incomplete block designs with nested rows and columns (BIBRCs) are found to be sufficient. It is also shown that, sufficient for a BIBRC with p=q to generally balanced, is that the row and column classifications together form a balanced incomplete block design, as does the block classification. All of the 2 x 2 BIBRCs are constructed to have this property.
"]},{"key":"dc:title","label":"Title","values":["Optimality and Construction of Designs with Generalized Group Divisible Structure"]}]}],"canonical_facts":{"dc:contributor":["John P. Morgan","Narasinga R. Chaganty","Ram Dahiya","Edward Markowski","Dayanand N. Naik"],"dc:creator":["Srivastav, Sudesh K."],"dc:date.available":["2019-06-13T07:00:00Z"],"dc:description.abstract":["This thesis is an investigation of the optimality and construction problems attendant to the assignment of v treatments to experimental units in b blocks of size k, paying special attention to settings for which equal replication of the treatments is not possible. The model is that of one way elimination of heterogeneity, in which the expectation of an observation on treatment i in block j is Ti + βj (treatment effect + block effect), where Ti and βj are unknown constants, 1 ≤ i ≤ v and 1 ≤ j ≤ b. All observations are assumed to be uncorrelated with same variance.
The generalized group divisible design with s groups, or GGDD(s), is defined in terms of the elements of the information matrix, instead of in terms of the elements of the concurrence matrix as done by Adhikary (1965) and extended by Jacroux (1982). This definition extends the class of designs to include non-binary members, and allows for broader optimality results. Some sufficient conditions are derived for GGDD(s) to be E- and MV-optimal. It is also shown how augmentation of addition blocks to certain GGDD(s)s produces other nonbinary, unequally replicated E- and MV-optimal block designs. Where nonbinary designs are found, they are generally preferable to binary designs in terms of interpretability, and often in terms of one or more formal optimality criteria as well.
The class of generalized nearly balanced incomplete block designs with maximum concurrence range l, or NBBD(l), is defined. This class extends the nearly balance incomplete block designs as defined by Cheng & Wu (1981), and the semi-regular graph designs as defined by Jacroux (1985), to cases where off-diagonal entries of the concurrence matrix differ by at most the positive integer l. Sufficient conditions are derived for a NBBD(2) to be optimal under a given type-I criterion. The conditions are used to establish the A- and D-optimality of an infinite series of NBBD(2)s having unequal numbers of replicates. Also, a result from Jacroux (1985) is used to establish the A-optimality of a new series of NBBD(1)s.
Several methods of construction of GGDD(s)s are developed from which many infinite series of designs are derived. Generally these designs satisfy the obtained sufficient conditions for E- and MV-optimality.
Finally, in the nested row-column setting, the necessary conditions for existence of 2 x 2 balanced incomplete block designs with nested rows and columns (BIBRCs) are found to be sufficient. It is also shown that, sufficient for a BIBRC with p=q to generally balanced, is that the row and column classifications together form a balanced incomplete block design, as does the block classification. All of the 2 x 2 BIBRCs are constructed to have this property.
"],"dc:identifier":["9780591048698","https://digitalcommons.odu.edu/mathstat_etds/66"],"dc:rights":["In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).
"],"dc:subject":["Optimality","Construction of designs","Statistics and Probability"],"dc:title":["Optimality and Construction of Designs with Generalized Group Divisible Structure"],"thesis:degree_discipline":["Mathematics & Statistics"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-07-24T03:35:00Z"}