|
Title
|
|
|
|
A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| Mixture experiments usually involve various constraints on the proportions of the ingredients of the mixture under study. In this paper, inspired by the fact that the available stock of certain ingredients is often limited, we focus on a new type of constraint, which we 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. The resulting optimal experimental design problem belongs to the class of nonlinear nonseparable multidimensional knapsack problems. We present a variable neighborhood search algorithm as well as a mixed integer nonlinear programming approach to tackle the problem to identify D- and I-optimal designs for mixture experiments when there is a limited stock of certain ingredients, and we show that the variable neighborhood search algorithm is highly competitive in terms of solution quality and computing time. (C) 2019 Elsevier B.V. All rights reserved. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
European journal of operational research. - Amsterdam
|
|
|
Publication
|
|
|
|
Amsterdam
:
2020
|
|
|
ISSN
|
|
|
|
0377-2217
|
|
|
DOI
|
|
|
|
10.1016/J.EJOR.2019.08.020
|
|
|
Volume/pages
|
|
|
|
281
:1
(2020)
, p. 201-221
|
|
|
ISI
|
|
|
|
000495480100016
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|