An Accelerated Sequential Simplex Search Technique

Abstract

This paper describes an acceleration technique for experimentation by sequential simplex search. A modification of the Spendley, Hext, and Himsworth method, this technique employs a simplex of n + 1 observations in each sequential block of experiments in seeking the optimum for a system involving n independent variables. The objective in applying this technique is to experimentally determine optimum or near-optimum system conditions in a minimum member of sequential experimental blocks. The accelerated technique is shown to achieve near-optimal solutions in one-half to one-third the number of sequential blocks required by the other methods.