Efficient algorithms for constructing D- and I-optimal exact designs for linear and non-linear models in mixture experiments.
The problem of finding optimal exact designs is more challenging than that of approximate optimal designs. In the present paper, we develop two efficient algorithms to numerically construct exact designs for mixture experiments. The first is a novel approach to the well-known multiplicative algorith...
| Autores: | , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2019 |
| País: | España |
| Recursos: | Universidad de Castilla-La Mancha |
| Repositório: | RUIdeRA. Repositorio Institucional de la UCLM |
| OAI Identifier: | oai:ruidera.uclm.es:10578/25158 |
| Acesso em linha: | http://hdl.handle.net/10578/25158 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Optimal experimental design D-optimality I-optimality Mixture experiments Multiplicative algorithm Genetic algorithm Exact designs |
| Resumo: | The problem of finding optimal exact designs is more challenging than that of approximate optimal designs. In the present paper, we develop two efficient algorithms to numerically construct exact designs for mixture experiments. The first is a novel approach to the well-known multiplicative algorithm based on sets of permutation points, while the second uses genetic algorithms. Using (i) linear and non-linear models, (ii) D- and I-optimality criteria, and (iii) constraints on the ingredients, both approaches are explored through several practical problems arising in the chemical, pharmaceutical and oil industry. |
|---|