Utami Syafitri, Bagus Sartono, Peter Goos
[This abstract is based on the authors' abstract.] Mixture experiments usually involve various constraints on the proportions of the ingredients of the mixture under study. In this article, inspired by the fact that the available stock of certain ingredients is often limited, the authors focus on a new type of constraint, which they refer to as an ingredient availability constraint. This type of constraint substantially complicates the search for optimal designs for mixture experiments. One difficulty, for instance, is that the optimal number of experimental runs is not known a priori. To deal with this complication, the authors propose a variable neighborhood search algorithm to find I-optimal designs for mixture experiments in case there is a limited stock of certain ingredients.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados