Year-end Sale % OFF 
Abstract
In this study, a new idealization to the exhaustive search optimization problem is given, Three formulations are given to a design-engineering problem using standard arrays: these are L243/ L27 OA, L27/ L108 OA and L81/ L108 OA and their sub-families. We found that certain idealizations, though realistic are still considered NP hard problems. As a remedy, a new exhaustive sequential algorithm is developed that solves NP hard problems in n sequential stages. Both the deterministic and statistical solutions are given and conclusions are drawn regarding their convergence properties. Composite arrays are developed out of the standard ones and simulations results indicate that certain composite arrays have better variance and convergence properties than other standard ones. These results are considered as part of the authors’ work to develop efficient statistical optimization techniques. Review of optimization related literatures indicates the strong need for development of global optimization techniques. A st...
Published Version
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: Transactions of the Canadian Society for Mechanical Engineering
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.
