Abstract
A minimax search strategy is described for locating the boundary point of a region on a line joining a feasible point to an infeasible point. Asymptotic strategies, useful when the number of experiments to be used in the search is not predetermined, are also given. These strategies are useful subroutines for many multidimensional optimization algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.