Abstract
SYNOPTIC ABSTRACTExact optimal designs have generally been constructed using a finite design space and various exchange algorithms, which are subject to premature convergence. Branch-and-bound methods guarantee optimal designs, but are only computationally feasible for small problems. We apply the generalized simulated annealing algorithm to the construction of exact optimal designs, and evaluate its effectiveness on both finite and continuous design spaces.
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 callMore From: American Journal of Mathematical and Management Sciences
Disclaimer: 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.
