A procedure for finding an improved upper bound on the number of optimal design points
Knowing an upper bound on the number of optimal design points greatly simplifies the search for an optimal design. Carathéodory’s Theorem is commonly used to identify an upper bound. However, the upper bound from Carathéodory’s Theorem is relatively loose when there are three or more parameters in the model. In this paper, an alternative approach of finding a sharper upper bound for classical optimality criteria is proposed. Examples are given to demonstrate how to use the new approach.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:58:y:2013:i:c:p:276-282. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.