Services

References

News

Contacts and CVs

The Simplex Optimization Methods

Simplex Optimization

The simplex methods are based on an initial design of k+1 trials, where k is the number of variables. A k+1 geometric figure in a k-dimensional space is called a simplex. The corners of this figure are called vertices.

A simplex defined by three different trial conditions for two control variables.

With two variables the first simplex design is based on three trials, for three variables it is four trials, etc. This number of trials is also the minimum for defining a direction of improvement. Therefore, it is a timesaving and economical way to start an optimization project.

After the initial trials the simplex process is sequential, with the addition and evaluation of one new trial at a time. The simplex searches systematically for the best levels of the control variables. The optimization process ends when the optimization objective is reached or when the responses cannot be improved further.

1. The Basic Simplex Method
2. The Modified Simplex Method
3. Evolutionary Operation
4. Mixture Optimization

Back to Optimization Methods Introduction