ABSTRACT
Optimising is the process of maximising a desired property or minimising an undesirable one. An example would be for the engineer to maximise the strength of a component and to minimise its weight. There are a number of search methods for examining simultaneous or sequential trial solutions over the entire domain of feasible designs to establish which point is optimal. These methods include the following: binary, fibonacci, golden section method and binary search method. In computer science, binary search, also known as half-interval search, logarithmic search or binary chop, is a search algorithm that finds the position of a target value within a sorted array. The Fibonacci search technique is a method of searching a sorted array using a divide and conquer algorithm that narrows down possible locations with the aid of Fibonacci numbers. The Golden Section is a technique to find the extremim of a strictly unimodal function by successively narrowing the range of values.
