Sequential Methods for Optimum Search

Let us restrict ourselves to putting the numerous variants of sequential optimum search into some sort of order. Most of the methods mentioned in the following review are described by BUNDAY [1984 a], who also gives BASIC programs details of the simplex method and its programming may be found in BUNDAY [1984 b]. 

If we expect optima as functions of one variable, i.e. one independent variable or one factor one can utilize  

Here it is advantageous that the number of experiments can be determined before the work starts. The method is adequate for unimodal response functions. 

If we can or must impose certain restrictions during optimization we may select  

On the other hand, conversion of restricted into free methods is possible, for example by use of 

---