A Combinatorial Search Technique for Constructing Optimal Designs for Biased Models

Akpan S. S., Udoh M. E, Nduka E. C.

Abstract


A new algorithm has been proposed to locate the global minimum of the alias matrix for a biased response function defined
in a set of distinct support points. The search begins by classifying all the support points in the experimental region of
interest into groups. Then starting from an arbitrary set of N support points, the algorithm obtains an N-point optimal
design by systematically adding and dropping support points from the various groups in such a way as to continuously
reduce the determinant of the alias matrix of the design at each step of the sequence. Numerical demonstrations confirm
the effectiveness of this algorithm.

Full Text: PDF DOI: 10.5539/jmr.v2n4p125

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.

----------------------------------------------------------------------------------------------------------------------------------------------------------------------

doaj_logo_new_120 proquest_logo_120images_120.