Please use this identifier to cite or link to this item: https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1305
Title: Algorithmic and analytical construction of efficient designs in small blocks for comparing consecutive pairs of treatments
Authors: Huda, Shahariar
Mukerjee, Rahul
Keywords: A-criterion
Approximate theory
D-criterion
E-criterion
Exact design
Multiplicative algorithm
Nesting
Nonbinary block
Issue Date: 2017
Publisher: SCOPUS
Journal of Statistical Computation and Simulation
Taylor and Francis Ltd.
Series/Report no.: 87(16)
Abstract: Optimal block designs in small blocks are explored under the A-, E- and D-criteria when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first formulate the problem via approximate theory which leads to a convenient multiplicative algorithm for obtaining A-optimal design measures. This, in turn, yields highly efficient exact designs, under the A-criterion, even when the number of blocks is rather small. Moreover, our approach is seen to allow nesting of such efficient exact designs which is an advantage when the resources for the experiment are available in possibly several stages. Illustrative examples are given and tables of A-optimal design measures are provided. Approximate theory is also seen to yield analytical results on E- and D-optimal design measures. � 2017 Informa UK Limited, trading as Taylor & Francis Group.
Description: Huda, Shahariar, Department of Statistics and OR, Faculty of Science, Kuwait University, P.O. Box-5969, Safat, 13060, Kuwait; Mukerjee, Rahul, Indian Institute of Management Calcutta, Kolkata, India
ISSN/ISBN - 00949655
pp.3195-3207
DOI - 10.1080/00949655.2017.1362404
URI: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027009499&doi=10.1080%2f00949655.2017.1362404&partnerID=40&md5=b4d7af4bd5ed6bce5ae35163b26fc112
https://ir.iimcal.ac.in:8443/jspui/handle/123456789/1305
Appears in Collections:Operations Management

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.