Abstract
We consider a unimodal continuous function of N variables over an N-dimensional rectangular parallelopiped and explain a search method to find the domain of uncertainty which contains the point that maximizes the function. Our search method does not require differentiability assumption. The function is projected along each dimension. An algorithm is developed to eliminate the subset of the domain at each step, which does not contain the solution. Lucas numbers are used in the elimination process.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
